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.
| Conference | 16th International Conference on Database and Expert Systems Applications, DExa 2005 |
|---|
| Period | 22/08/05 → 26/08/05 |
|---|
Cite this
-
APA
-
Author
-
BIBTEX
-
Harvard
-
Standard
-
RIS
-
Vancouver
Tang, N., Yu, J. X. X., Wong, K. F. F., Lü, K.
, & Li, J. (2005).
Accelerating XML structural join by partitioning. In
Lecture Notes in Computer Science (Vol. 3588, pp. 280-289)
@inproceedings{8e634010a6d64ae793b6fa0941c34bbf,
title = "Accelerating XML structural join by partitioning",
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. {\circledC} Springer-Verlag Berlin Heidelberg 2005.",
author = "N. Tang and Yu, {J.X. X.} and Wong, {K.F. F.} and K. L{\"u} and Jianxin Li",
year = "2005",
language = "English",
isbn = "03029743",
volume = "3588",
pages = "280--289",
booktitle = "Lecture Notes in Computer Science",
}
Tang, N, Yu, JXX, Wong, KFF, Lü, K
& Li, J 2005,
Accelerating XML structural join by partitioning. in
Lecture Notes in Computer Science. vol. 3588, pp. 280-289, 16th International Conference on Database and Expert Systems Applications, DExa 2005,
22/08/05.
TY - GEN
T1 - Accelerating XML structural join by partitioning
AU - Tang, N.
AU - Yu, J.X. X.
AU - Wong, K.F. F.
AU - Lü, K.
AU - Li, Jianxin
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
M3 - Conference paper
SN - 03029743
VL - 3588
SP - 280
EP - 289
BT - Lecture Notes in Computer Science
ER -