Accelerating XML structural join by partitioning

Authors:
Nan Tang;Jeffrey Xu Yu;Kam-Fai Wong;Kevin Lü;Jianxin Li
Affiliations:
Department of Systems Engineering & Engineering Management, The Chinese University of Hong Kong, Hong Kong, China;Department of Systems Engineering & Engineering Management, The Chinese University of Hong Kong, Hong Kong, China;Department of Systems Engineering & Engineering Management, The Chinese University of Hong Kong, Hong Kong, China;Brunel University, London, UK;College of Information Science and Engineering, Northeastern University, China
Venue:
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Year:
2005

Citing 9
Cited 0

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
Indexing and Querying XML Data for Regular Path Expressions

Proceedings of the 27th International Conference on Very Large Data Bases
Maintaining order in a linked list

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Managing very large document collections using semantics

Journal of Computer Science and Technology
Structural Joins: A Primitive for Efficient XML Query Pattern Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
RPE query processing and optimization techniques for XML databases

Journal of Computer Science and Technology
Efficient structural joins on indexed XML documents

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Query processing and optimization for regular path expressions

CAiSE'03 Proceedings of the 15th international conference on Advanced information systems engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Structural join is the core part of XML queries and has a significant impact on the performance of XML queries, several classical structural join algorithms have been proposed such as Stack-tree join and XR-Tree join. In this paper, we consider to answer the problem of structural join by partitioning. We first extend the relationships between nodes to the relationships between partitions in the plane and get some observations. We then propose a new partition-based method P-Join for structural join. Based on P-Join, moreover, we present an enhanced partitioned-based spatial structural join algorithm PSSJ.