Accelerating XML structural join by partitioning

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Tang, N., Yu, J. X., Wong, K. F., Lü, K., & Li, J. (2005). Accelerating XML structural join by partitioning. In Lecture Notes in Computer Science (Vol. 3588, pp. 280–289). Springer Verlag. https://doi.org/10.1007/11546924_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free