Lore: a database management system for semistructured data
ACM SIGMOD Record
Catching the boat with Strudel: experiences with a Web-site management system
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
XBase: making your gigabyte disk queriable
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
XQuery formal semantics state and challenges
ACM SIGMOD Record
Index Structures for Path Expressions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
XML Data and Object Databases: A Perfect Couple?
Proceedings of the 17th International Conference on Data Engineering
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
XMach-1: A Benchmark for XML Data Management
Datenbanksysteme in Büro, Technik und Wissenschaft (BTW), 9. GI-Fachtagung,
The XML benchmark project
What makes the differences: benchmarking XML database implementations
ACM Transactions on Internet Technology (TOIT)
Holistically Stream-based Processing Xtwig Queries
World Wide Web
Extending XML with nonmonotonic multiple inheritance
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
| Hi-index | 0.00 |
DOM is an XML access interface proposed by W3C. XML documents can be stored and accessed through it and XML queries can be evaluated based on DOM. In this paper, a persistent DOM storage method is designed with two kinds of clustering strategies, filiationclustering and sibling-clustering to improve DOM interface-based query performance. Furthermore, XML indexing and query optimization techniques are also explored. Four structural indexes are proposed to speed up the basic operations on persistent DOM trees, and two value indexes are introduced to improve the performance of queries with predicates. Moreover, some RPE optimization rules are proposed by using the pathshorten and path-complementing principles. Path-shorten reduces the number of joins by shortening the path and path-complementing is a technique to use a different RPE to substitute the path specified in a user query. Experimental results show that the proposed algorithms are quite efficient.