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)
Storing and querying ordered XML using a relational database system
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
Index Structures for Path Expressions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
On boosting holism in XML twig pattern matching using structural indexing techniques
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
From region encoding to extended dewey: on efficient processing of XML twig pattern matching
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Tree-pattern queries on a lightweight XML processor
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Staircase join: teach a relational DBMS to watch its (axis) steps
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On the efficient search of an XML twig query in large DataGuide trees
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
TJDewey --- On the Efficient Path Labeling Scheme Holistic Approach
Database Systems for Advanced Applications
Towards unifying advances in twig join algorithms
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
XML query processing: efficiency and optimality
Proceedings of the 16th International Database Engineering & Applications Sysmposium
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
In recent years, many approaches to XML twig pattern searching have been developed. Holistic approaches such as TwigStack are particularly significant in that they provide a powerful theoretical model for optimal processing of some query types. Holistic algorithms use various partitionings of an XML document called streaming schemes and they prove algorithm optimality depending on query characteristics. In this article, we introduce a variant of the TwigStack algorithm which can work with various streaming schemes. Its efficiency does not deteriorate when the number of streams per query node is increased, as it does in the case of the iTwigJoin algorithm. Since the indices utilized by the iTwigJoin and our algorithm are exactly the same, we can use heuristics to select the appropriate algorithm. The aim of this paper is to show that the prefix path streaming scheme algorithms can be efficient even for documents with many labeled paths.