Accelerating XPath location steps

By Torsten Grust. ACM SIGMOD Conference, 2002

517 citations recorded by the source corpus.

This work is a proposal for a database index structure that has been specifically designed to support the evaluation of XPath queries. As such, the index is capable to support all XPath axes (including ancestor, following, preceding-sibling, descendant-or-self, etc.). This feature lets the index stand out among related work on XML indexing structures which had a focus on regular path expressions (which correspond to the XPath axes children and descendant-or-self plus name tests). Its ability to start traversals from arbitrary context nodes in an XML document additionally enables the index to support the evaluation of path traversals embedded in XQuery expressions. Despite its flexibility, the new index can be implemented and queried using purely relational techniques, but it performs especially well if the underlying database host provides support for R-trees. A performance assessment which shows quite promising results completes this proposal.

Subfields: Computer Networks and Communications, Information Systems, Signal Processing

View Paper: https://www.semanticscholar.org/paper/35771247eb8efb077cba13eea8bee2778eda441e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Jeffrey Xu Yu
2. Hongjun Lu
3. Zografoula Vagena
4. Haifeng Jiang

In Information Systems

1. Jeffrey Xu Yu
2. Hongjun Lu
3. Haifeng Jiang

In Signal Processing

1. Jeffrey Xu Yu
2. Hongjun Lu
3. Zografoula Vagena
4. Haifeng Jiang

Citations in the corpus

• Holistic Twig Joins on Indexed XML Documents (2003, background): “[4, 7, 8] are index-based approaches.”
• eXist: An Open Source Native XML Database (2002, unknown): “No further installation is required.”
• ORDPATHs: insert-friendly XML node labels (2004, unknown): “In [4], each node x is marked by node type and labeled with two numberings, preorder (pre(x)) and postorder (post(x)), together with a parent identifier.”
• Efficient Structural Joins on Indexed XML Documents (2002, background): “One approach is to assign to each tree node three numbers, namely: the node's preorder and postorder ranks as well as its level in the XML tree [13] [40] [24] [1] [19].”