• Corpus ID: 73579282

Tree Structure Compression

  title={Tree Structure Compression},
  author={Sebastian Maneth and Nikolay L Mihaylov and Sherif Sakr},
In an XML document a considerable fraction consists of markup, that is, begin and end-element tags describing the document’s tree structure. XML compression tools such as XMill separate the tree structure from the data content and compress each separately. The main focus in these compression tools is how to group similar data content together prior to performing standard data compression such as gzip, bzip2, or ppm. In contrast, the focus of this paper is on compressing the tree structure part… 
1 Citations

Figures and Tables from this paper

A Survey of Sensor Web Services for the Smart Grid
This survey first briefly presents the state of the art in SWS technology by describing the techniques for customizing web services to fit the sensor node capabilities such as customizing the WSDL file, compressing XML documents and redesigning TCP protocol.


Efficient memory representation of XML document trees
AXECHOP: a grammar-based compressor for XML
A compression scheme tailored specifically to XML named AXECHOP is presented, which generates a context-free grammar capable of deriving this original structure of the document and is passed through an adaptive arithmetic coder before being written to the compressed file.
Path Queries on Compressed XML
Supporting efficient query processing on compressed XML files
By organizing the compression result as a set of context free grammar rules, the scheme supports efficient processing of XPath queries without decompression and achieves comparable compression ratio as gzip while its query processing time is among the best of existing algorithms.
XGrind: a query-friendly XML compressor
Performance evaluations over a variety of XML documents and user queries indicate that XGrind simultaneously delivers improved query processing times and reasonable compression ratios.
Tree Transducers and Tree Compressions
A tree can be compressed into a DAG by sharing common subtrees, but a more powerful way of tree compression is to allow the sharing of tree patterns, i.e., internal parts of the tree.
XMill: an efficient compressor for XML data
We describe a tool for compressing XML data, with applications in data exchange and archiving, which usually achieves about twice the compression ratio of gzip at roughly the same speed. The
Structural Selectivity Estimation for XML Documents
  • D. FisherS. Maneth
  • Computer Science
    2007 IEEE 23rd International Conference on Data Engineering
  • 2007
A new synopsis for XML documents is introduced which can be effectively used to estimate the selectivity of complex path queries, based on a lossy compression of the document tree that underlies the XML document, and can be computed in one pass from the document.
Querying and maintaining a compact XML storage
This paper presents a new storage scheme for XML data that supports all navigational operations in near constant time, and features a small memory footprint that increases cache locality, whilst still supporting standard APIs and necessary database operations, such as queries and updates, efficiently.
Tree Automata and XPath on Compressed Trees
The complexity of various membership problems for tree automata on compressed trees is analyzed and the complexity of the XPath evaluation problem on trees that are compressed via straight-line context-free tree grammars is investigated.