Brunel University Research Archive (BURA) >
Brunel Business School >
Brunel Business School Research Papers >
Please use this identifier to cite or link to this item:
|Title: ||Accelerating XML structural join by partitioning|
|Authors: ||Tang, N|
|Publication Date: ||2005|
|Citation: ||Lecture Notes in Computer Science 3588: 280-289, 2005|
|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.|
|Description: ||This is an open access article that can be obtained from the link below - Copyright @ 2005 Springer Verlag|
|Appears in Collections:||Brunel Business School Research Papers|
Files in This Item:
There are no files associated with this item.
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.