Index structures for structured documents
Proceedings of the first ACM international conference on Digital libraries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
XRel: a path-based approach to storage and retrieval of XML documents using relational databases
ACM Transactions on Internet Technology (TOIT)
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Improved labeling scheme for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
An XML Indexing Structure with Relative Region Coordinate
Proceedings of the 17th International Conference on Data Engineering
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
A Graph Query Language and Its Query Processing
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Node labeling schemes for dynamic XML documents reconsidered
Data & Knowledge Engineering
On the efficiency of secure XML broadcasting
Information Sciences: an International Journal
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
Dynamic Labelling Scheme for XML Data Processing
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
Implementing and Optimizing Fine-Granular Lock Management for XML Document Trees
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
The Real Performance Drivers behind XML Lock Protocols
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Essential Performance Drivers in Native XML DBMSs
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Processing keyword search on XML: a survey
World Wide Web
Prefix-based node numbering for temporal XML
WISE'11 Proceedings of the 12th international conference on Web information system engineering
A formal access control model for XML databases
SDM'05 Proceedings of the Second VDLB international conference on Secure Data Management
MonetDB/XQuery—Consistent and efficient updates on the pre/post plane
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Hi-index | 0.00 |
Almost all existing approaches use certain numbering scheme to encode XML elements to facilitate query processing when XML data is stored in databases. For example, under the most popular region-based numbering scheme, the starting and ending positions of an element in a document are used as the code to identify the element so that the ancestor/descendant relationship between two elements can be determined by merely examining their codes. While such numbering scheme can greatly improve query performance, renumbering large amount of elements caused by updates becomes a performance bottleneck if XML documents are frequently updated. Unfortunately, no satisfactory work has been reported for efficient update of XML data. In this paper, we first formalize the XML data update problem by defining the basic operators to support most XML update queries. We then present a new numbering scheme that not only requires minimal code-length in comparison with existing numbering schema but also improves update performance when XML data is frequently updated at arbitrary positions. The fundamental difference between our new scheme and existing ones is that, instead of maintaining the explicit codes for elements, we only store the necessary information and generate the codes when they are needed in query processing. In addition to present the basic scheme, we also discuss some optimization techniques to further reduce the update cost. Results of a comprehensive performance study are provided to show the advantages of the new scheme.