From structured documents to novel query facilities
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Lore: a database management system for semistructured data
ACM SIGMOD Record
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)
Path materialization revisited: an efficient storage model for XML data
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
Accelerating XPath location steps
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
XML Data Management: Native XML and XML Enabled DataBase Systems
XML Data Management: Native XML and XML Enabled DataBase Systems
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
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
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Modeling nested relationships in XML documents using relational databases
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Relevance measures for XML information retrieval
International Journal of Web and Grid Services
| Hi-index | 0.00 |
In recent years, a plethora of work has been done to develop methods for managing XML documents using relational databases. In order to support XPath or any other XML query language, the relational schema must allow fast retrieval of the parents, children, ancestors, or descendants of a given set of nodes. Most of the previous work has aimed at this goal using pre-/postorder encoding. Relying on this method, however, may lead to scalability problems, since the structural relationships have to be checked using nonequijoins, i.e., joins using as their join condition. Thus, we discuss alternative methods, such as ancestor/descendant and ancestor/leaf indexes, and present a novel method, namely a so called proxy index. Our method allows us to replace nonequijoins with equijoins, i.e., joins using = as their join condition. The results of our comprehensive performance experiments demonstrate the effectiveness of the proxy index.