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.
Lecture Notes in Computer Science: proceedings of the 16th International Conference on Database and Expert Systems Applications (DEXA 2005), Copenhagen, Denmark, 22-26 August 2005 / Kim Viborg Andersen, John Debenham and Roland Wagner (eds.),
Vol. 3588, pp. 280-289