XMill: an efficient compressor for XML data
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Learning XML
Accelerating XPath location steps
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
XPRESS: a queriable compression for XML data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
TIMBER: a native system for querying XML
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
XGRIND: A Query-Friendly XML Compressor
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
XSeq: an indexing infrastructure for tree pattern queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
XCQ: A queriable XML compression system
Knowledge and Information Systems
Mixed mode XML query processing
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
| Hi-index | 0.03 |
XML has becoming the standard way for representing and transforming data over the World Wide Web. The annoying problem with XML documents is that they have a very high ratio of redundancy, which makes these documents storage demanding and require a large network bandwidth for transmission. To remedy this problem, a lot of approaches had been conducted in order to compress XML documents. Some of these approaches supply querying the compressed documents, while others compress the XML documents for archival purposes. In this paper we propose a new XML compression technique that obeys the structure of the XML documents and provides the ability to querying the compressed document with both content and structure (CAS) queries type. XML elements and attributes names are encoded by using fixed-point dictionary-based technique. Other XML data are organized into special containers according to their path from the root attribute, and the containers are compressed using the same fixed-point technique. Using different types of XML documents and different styles of user queries, the XQPoint has been experimented to test its effectiveness in both the compression ratio and the querying performance.