On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 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
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th 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
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient Processing of XML Containment Queries Using Partition-Based Schemes
IDEAS '04 Proceedings of the International Database Engineering and Applications Symposium
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Optimizing cursor movement in holistic twig joins
Proceedings of the 14th ACM international conference on Information and knowledge management
Node labeling schemes for dynamic XML documents reconsidered
Data & Knowledge Engineering
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Optimizing sorting and duplicate elimination in XQuery path expressions
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Rules for query rewrite in native XML databases
DataX '08 Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web
XTCcmp: XQuery compilation on XTC
Proceedings of the VLDB Endowment
BNCOD'07 Proceedings of the 24th British national conference on Databases
| Hi-index | 0.00 |
Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many requirements, e. g., guarantee linear worst-case runtime; generate sorted, duplicate-free output; adapt to fiercely varying input sizes and element distributions; enable pipelining; and (probably) more. Therefore, it is not possible to design the structural join algorithm. Rather, the provision of different specialized operators, from which the query optimizer can choose, is beneficial for query efficiency. We propose new hash-based structural joins that can process unordered input sequences possibly containing duplicates. We also show that these algorithms can substantially reduce the number of sort operations on intermediate results for (complex) tree structured queries (twigs).