XMill: an efficient compressor for XML data
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Representing dynamic binary trees succinctly
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
XPRESS: a queriable compression for XML data
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
Succinct static data structures
Succinct static data structures
Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
Accelerating XPath evaluation in any RDBMS
ACM Transactions on Database Systems (TODS)
A Succinct Physical Storage Scheme for Efficient Evaluation of Path Queries in XML
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
Compressing and searching XML data via two zips
Proceedings of the 15th international conference on World Wide Web
Path queries on compressed XML
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Mixed mode XML query processing
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient memory representation of XML documents
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
L-Tree: a dynamic labeling structure for ordered XML data
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
XML Storage and Processing on Mobile Devices
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Information Systems
XML compression techniques: A survey and comparison
Journal of Computer and System Sciences
Efficient Data Structure for XML Keyword Search
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
DOM tree browsing of a very large XML document: Design and implementation
Journal of Systems and Software
Binary XML storage and query processing in Oracle 11g
Proceedings of the VLDB Endowment
Semi-indexing semi-structured data in tiny space
Proceedings of the 20th ACM international conference on Information and knowledge management
A compact XML storage scheme supporting efficient path querying
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Dynamizing succinct tree representations
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Feasibility and a case study on content optimization services on cloud
Information Systems Frontiers
Hi-index | 0.00 |
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents a new storage scheme for XML data that supports all navigational operations in near constant time. In addition to supporting efficient queries, the space requirement of the proposed scheme is within a constant factor of the information theoretic minimum, while insertions and deletions can be performed in near constant time as well. As a result, the proposed structure features a small memory footprint that increases cache locality, whilst still supporting standard APIs, such as DOM, and necessary database operations, such as queries and updates, efficiently. Analysis and experiments show that the proposed structure is space and time efficient.