Algorithmics and applications of tree and graph searching
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Accelerating XPath location steps
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Covering indexes for branching path queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
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
ViST: a dynamic index method for querying XML data by tree structures
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Journal of Computer Science and Technology
ACM SIGMOD Record
An evaluation of binary xml encoding optimizations for fast stream based xml processing
Proceedings of the 13th international conference on World Wide Web
On the integration of structure indexes and inverted lists
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
An evaluation of XML indexes for structural join
ACM SIGMOD Record
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Path queries on compressed XML
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient XPath query processing
CASCON '08 Proceedings of the 2008 conference of the center for advanced studies on collaborative research: meeting of minds
XPath whole query optimization
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importance of XML, XPath, and XQuery, several methods have been proposed for creating XML structure indexes and many variants using relational technology have been proposed. This work proposes a new XML structure index, called MTree, which is designed to be optimal for traversing all XPath axes. The primary feature of MTree lies in its ability to provide the next subtree root node in document order, for all axes, to each context node in O(1). MTree is a special purpose XPath index structure that matches the special purpose query requirements for XPath. This approach is in contrast to other approaches that map the problem domain into general purpose index structures such as B-Tree that must reconstruct the XML tree from those structures for every query. MTree supports modification operations such as insert and delete. MTree has been implemented both in memory and on disk, and performance results using XMark benchmark data are presented showing up to two orders of magnitude improvement over other well-known implementations.