On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
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
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
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
Compact Labeling Scheme for Ancestor Queries
SIAM Journal on Computing
Efficient Processing of Updates in Dynamic XML Data
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Efficient updates in dynamic XML data: from binary string to quaternary string
The VLDB Journal — The International Journal on Very Large Data Bases
A Dynamic Labeling Scheme Using Vectors
DEXA '07 Proceedings of the 18th international conference on Database and Expert Systems Applications
DDE: from dewey to a fully dynamic XML labeling scheme
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Hi-index | 0.00 |
Designing dynamic labeling schemes to support order- sensitive queries for XML documents has been recognized as an important research problem. In this work, we consider the problem of making range-based XML labeling schemes dynamic through the process of encoding. We point out the problems of existing encoding algorithms which include computational and memory inefficiencies. We introduce a novel Search Tree-based (ST) encoding technique to overcome these problems. We show that ST encoding is widely applicable to different dynamic labels and prove the optimality of our results. In addition, when combining with encoding table compression, ST encoding provides high flexibility of memory usage. Experimental results confirm the benefits of our encoding techniques over the previous encoding algorithms.