A methodology for coupling fragments of XPath with structural indexes for XML documents

Supporting efficient access to XML data using XPath [3] continues to be an important research problem [6, 12]. XPath queries are used to specify nodelabeled trees which match portions of the hierarchical XML data. In XPath query evaluation, indices similar to those used in relational database systems - namely, value indices on tags and text values - are first used, together with structural join algorithms [1, 2, 19]. This approach turns out to be simple and efficient. However, the structural containment relationships native to XML data are not directly captured by value indices.

[1]  Christoph Koch,et al.  Processing queries on tree-structured data efficiently , 2006, PODS.

[2]  Jeffrey F. Naughton,et al.  Covering indexes for branching path queries , 2002, SIGMOD '02.

[3]  Jeffrey F. Naughton,et al.  On the integration of structure indexes and inverted lists , 2004, Proceedings. 20th International Conference on Data Engineering.

[4]  Davide Sangiorgi,et al.  On the origins of bisimulation and coinduction , 2009, TOPL.

[5]  Andrew Lim,et al.  D(k)-index: an adaptive structural summary for graph-structured data , 2003, SIGMOD '03.

[6]  Roy Goldman,et al.  DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases , 1997, VLDB.

[7]  Jignesh M. Patel,et al.  Structural joins: a primitive for efficient XML query pattern matching , 2002, Proceedings 18th International Conference on Data Engineering.

[8]  Hao He,et al.  Incremental maintenance of XML structural indexes , 2004, SIGMOD '04.

[9]  David J. DeWitt,et al.  On supporting containment queries in relational database management systems , 2001, SIGMOD '01.

[10]  Dirk Van Gucht,et al.  Trie Indexes for Efficient XML Query Evaluation , 2008, WebDB.

[11]  Scott Boag,et al.  XQuery 1.0 : An XML Query Language , 2007 .

[12]  George H. L. Fletcher,et al.  Structural characterizations of the semantics of XPath as navigation tool on a document , 2006, PODS.

[13]  Vassilis J. Tsotras,et al.  Tree-Pattern Queries on a Lightweight XML Processor , 2005, VLDB.

[14]  Divesh Srivastava,et al.  Holistic twig joins: optimal XML pattern matching , 2002, SIGMOD '02.

[15]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[16]  Ehud Gudes,et al.  Exploiting local similarity for indexing paths in graph-structured data , 2002, Proceedings 18th International Conference on Data Engineering.

[17]  Rada Chirkova,et al.  Efficiently Querying Large XML Data Repositories: A Survey , 2007, IEEE Transactions on Knowledge and Data Engineering.

[18]  Jignesh M. Patel,et al.  XIST: An XML Index Selection Tool , 2004, XSym.

[19]  Irena Holubová,et al.  Statistical Analysis of Real XML Data Collections , 2006, COMAD.

[20]  Steven J. DeRose,et al.  XML Path Language (XPath) Version 1.0 , 1999 .

[21]  Hao He,et al.  Multiresolution indexing of XML for frequent queries , 2004, Proceedings. 20th International Conference on Data Engineering.

[22]  Dan Suciu,et al.  Index Structures for Path Expressions , 1999, ICDT.

[23]  Kyuseok Shim,et al.  An adaptive path index for XML data using the query workload , 2005, Inf. Syst..

[24]  Prakash Ramanan.  Covering Indexes for XML Queries: Bisimulation - Simulation = Negation , 2003, VLDB.