Storing semistructured data with STORED
SIGMOD '99 Proceedings of the 1999 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
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
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Efficient Relational Storage and Retrieval of XML Documents
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
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
Why off-the-shelf RDBMSs are better at XPath than you might expect
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The NEXT framework for logical XQuery optimization
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The Michigan benchmark: towards XML query performance diagnostics
Information Systems
XML databases and beyond-plenty of architectural challenges ahead
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Optimizing XML twig queries in relational systems
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
| Hi-index | 0.00 |
Storing an XML document as a single record of type BLOB (or sequence of bytes) in RDBMS has become a widely used solution that reduces the complexity of reassembling the original document. However, shredding and indexing the XML document, using special labeling methods to recover the document order, is still required to efficiently support data-centric queries. The Dewey based labeling method has been considered to be the most suitable labeling technique to support dynamic XML documents. In this paper, we present a new space-efficient and easy to process Dewey-based labeling scheme. The new label structure, which is composed of two components: (Parent, Child) in Dewey format, would significantly improve the performance of XML queries that are based on parent-child and sibling relationships. Furthermore, we introduce an efficient alternative approach to navigate upwards the XML tree, which can be used to validate ancestor relationships. We report on an extensive experimental label length evaluation and performance tests between our approach and some recent Dewey based approaches using well-known XML benchmarks.