A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
LSDX: a new labelling scheme for dynamically updating XML data
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
QED: a novel quaternary encoding to completely avoid re-labeling in XML updates
Proceedings of the 14th ACM international conference on Information and knowledge management
An improved prefix labeling scheme: a binary string approach for dynamic ordered XML
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
A Low-Storage-Consumption XML Labeling Method for Efficient Structural Information Extraction
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
OrdPathX: Supporting Two Dimensions of Node Insertion in XML Data
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Desirable properties for XML update mechanisms
Proceedings of the 2010 EDBT/ICDT Workshops
Hi-index | 0.01 |
XML is becoming the new standard for the exchange and publishing of data over the Internet. Documents obeying the XML standard can be viewed as trees basically the parse tree of the document. XML database systems often give each item in the document (node in the tree) a unique logical identifier (called a label) and use those labels for an efficient processing of queries, in particular queries involving structural conditions or testing for changes in the document content. Therefore several path indexing and numbering schemes have been proposed. XML data on the Web are subjected to frequent updates. During the update on XML data, most of these approaches will need to recompute existing labels, which is rather time consuming. The goal of our labeling scheme is to design a persistent structural labeling scheme that supports the representation of ancestor-descendant relationship and sibling relationship between nodes. Moreover our labeling scheme supports insertion of new nodes at arbitrary positions in the XML tree without re-labeling and without conflicting existing labels.