On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 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
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
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
On the integration of structure indexes and inverted lists
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Proceedings of the thirteenth ACM international conference on Information and knowledge management
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
Optimizing cursor movement in holistic twig joins
Proceedings of the 14th ACM international conference on Information and knowledge management
Path summaries and path partitioning in modern XML databases
Proceedings of the 15th international conference on World Wide Web
Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
Holistic twig joins on indexed XML documents
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
XML twig pattern matching using version tree
Data & Knowledge Engineering
Fast Matching of Twig Patterns
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
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
S3: Evaluation of tree-pattern XML queries supported by structural summaries
Data & Knowledge Engineering
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
On the Efficiency of a Prefix Path Holistic Algorithm
XSym '09 Proceedings of the 6th International XML Database Symposium on Database and XML Technologies
Efficient holistic twig joins in leaf-to-root combining with root-to-leaf way
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Twiglist: make twig pattern matching fast
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Efficient processing of XML twig pattern: a novel one-phase holistic solution
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Hi-index | 0.00 |
Twig joins are key building blocks in current XML indexing systems, and numerous algorithms and useful data structures have been introduced. We give a structured, qualitative analysis of recent advances, which leads to the identification of a number of opportunities for further improvements. Cases where combining competing or orthogonal techniques would be advantageous are highlighted, such as algorithms avoiding redundant computations and schemes for cheaper intermediate result management. We propose some direct improvements over existing solutions, such as reduced memory usage and stronger filters for bottom-up algorithms. In addition we identify cases where previous work has been overlooked or not used to its full potential, such as for virtual streams, or the benefits of previous techniques have been underestimated, such as for skipping joins. Using the identified opportunities as a guide for future work, we are hopefully one step closer to unification of many advances in twig join algorithms.