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
Storing and querying ordered XML using a relational database system
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
MASS: a multi-axis storage structure for large XML documents
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
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
A Persistent Labeling Scheme for Dynamic Ordered XML Trees
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Efficient updates in dynamic XML data: from binary string to quaternary string
The VLDB Journal — The International Journal on Very Large Data Bases
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
Light-weight access control scheme for XML data
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II
Efficient access control labeling scheme for secure XML query processing
Computer Standards & Interfaces
| Hi-index | 0.00 |
We introduce a novel XML labeling scheme called OrdPathX which supports both leaf and internal node insertions for XML data. Dynamic XML labeling has been studied for years. However almost all labeling schemes allow only leaf node insertions. Inspired by the careting-in technique of OrdPath [7], we propose a new labeling algorithm which supports internal node insertions gracefully without relabeling. We will describe the labeling algorithm and the associated operations for various inter-node relationship determination. Experimental results show that OrdPathX can handle internal node insertions efficiently.