Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTang, N-
dc.contributor.authorYu, JX-
dc.contributor.authorWong, KF-
dc.contributor.authorLü, K-
dc.contributor.authorLi, J-
dc.identifier.citationLecture Notes in Computer Science 3588: 280-289, 2005en_US
dc.descriptionThis is an open access article that can be obtained from the link below - Copyright @ 2005 Springer Verlagen_US
dc.description.abstractStructural 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.en_US
dc.titleAccelerating XML structural join by partitioningen_US
dc.typeResearch Paperen_US
Appears in Collections:Business and Management
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.