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
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
Efficient keyword search for smallest LCAs in XML databases
Proceedings of the 2005 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
Multiway SLCA-based keyword search in XML data
Proceedings of the 16th international conference on World Wide Web
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
Desirable properties for XML update mechanisms
Proceedings of the 2010 EDBT/ICDT Workshops
EBSL: supporting deleted node label reuse in XML
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Context-preserving XQuery fusion
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Algebraic incremental maintenance of XML views
Proceedings of the 14th International Conference on Extending Database Technology
SIAM Journal on Computing
Labeling recursive workflow executions on-the-fly
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
TwigTable: using semantics in XML twig pattern query processing
Journal on data semantics XV
Processing keyword search on XML: a survey
World Wide Web
Efficient label encoding for range-based dynamic XML labeling schemes
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Labeling workflow views with fine-grained dependencies
Proceedings of the VLDB Endowment
Exploiting and Maintaining Materialized Views for XML Keyword Queries
ACM Transactions on Internet Technology (TOIT)
Efficient labeling scheme for dynamic XML trees
Information Sciences: an International Journal
ANDES: efficient evaluation of NOT-twig queries in relational databases
The VLDB Journal — The International Journal on Very Large Data Bases
DeltaNI: an efficient labeling scheme for versioned hierarchical data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Algebraic incremental maintenance of XML views
ACM Transactions on Database Systems (TODS)
Growing triples on trees: an XML-RDF hybrid model for annotated documents
The VLDB Journal — The International Journal on Very Large Data Bases
Dynamically querying possibilistic XML data
Information Sciences: an International Journal
Hi-index | 0.00 |
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that has received a lot of research attention. Existing dynamic labeling schemes, however, often sacrifice query performance and introduce additional labeling cost to facilitate arbitrary updates even when the documents actually seldom get updated. Since the line between static and dynamic XML documents is often blurred in practice, we believe it is important to design a labeling scheme that is compact and efficient regardless of whether the documents are frequently updated or not. In this paper, we propose a novel labeling scheme called DDE (for Dynamic DEwey) which is tailored for both static and dynamic XML documents. For static documents, the labels of DDE are the same as those of dewey which yield compact size and high query performance. When updates take place, DDE can completely avoid re-labeling and its label quality is most resilient to the number and order of insertions compared to the existing approaches. In addition, we introduce Compact DDE (CDDE) which is designed to optimize the performance of DDE for insertions. Both DDE and CDDE can be incorporated into existing systems and applications that are based on dewey labeling scheme with minimum efforts. Experiment results demonstrate the benefits of our proposed labeling schemes over the previous approaches.