On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Accelerating XPath location steps
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
Efficient Supporting XML Query and Keyword Search in Relational Database Systems
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
An evaluation of XML indexes for structural join
ACM SIGMOD Record
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Holistic twig joins on indexed XML documents
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
Design and implementation of a high-fidelity AC metering network
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
| Hi-index | 0.00 |
The structure queries of XQuery result in structural joins of various relationships. While several efficient algorithms have been proposed in evaluating ancestor-descendant and parent-child relationships, few efforts are put on the study on sibling relationship. In this paper, we study the structural joins of preceding-sibling-following-sibling relationship. To accelerate structural joins of parent-child and preceding-sibling-following-sibling relationships, optimizing techniques are employed to filter out and minimize unnecessary reads of elements using parent's structural information. Then, two efficient structural join algorithms in evaluating sibling relationship are proposed, in which nodes that do not participate in the join can be judged beforehand and then skipped using B+-tree index. Besides, each element list joined is scanned sequentially once at most. Furthermore, output of join results is sorted in document order. Our experimental results not only demonstrate the effectiveness of our optimizing techniques for sibling axes, but also validate the efficiency of our algorithms. To the best of our knowledge, this is the first effort that addresses this problem.