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.
|Title of host publication||Lecture Notes in Computer Science|
|Number of pages||10|
|Publication status||Published - 2005|
|Event||16th International Conference on Database and Expert Systems Applications, DExa 2005 - Copenhagen, Denmark|
Duration: 22 Aug 2005 → 26 Aug 2005
|Conference||16th International Conference on Database and Expert Systems Applications, DExa 2005|
|Period||22/08/05 → 26/08/05|