Accelerating XML structural join by partitioning

Nan Tang, Jeffrey Xu Yu, Kam Fai Wong, Kevin Lü, Jianxin Li

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsK.V. Andersen, J. Debenham, R. Wagner
Pages280-289
Number of pages10
Volume3588
Publication statusPublished - 2005
Externally publishedYes
Event16th International Conference on Database and Expert Systems Applications, DExa 2005 - Copenhagen, Denmark
Duration: 22 Aug 200526 Aug 2005

Other

Other16th International Conference on Database and Expert Systems Applications, DExa 2005
CountryDenmark
CityCopenhagen
Period22/8/0526/8/05

Fingerprint

XML

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Tang, N., Yu, J. X., Wong, K. F., Lü, K., & Li, J. (2005). Accelerating XML structural join by partitioning. In K. V. Andersen, J. Debenham, & R. Wagner (Eds.), Lecture Notes in Computer Science (Vol. 3588, pp. 280-289)

Accelerating XML structural join by partitioning. / Tang, Nan; Yu, Jeffrey Xu; Wong, Kam Fai; Lü, Kevin; Li, Jianxin.

Lecture Notes in Computer Science. ed. / K.V. Andersen; J. Debenham; R. Wagner. Vol. 3588 2005. p. 280-289.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tang, N, Yu, JX, Wong, KF, Lü, K & Li, J 2005, Accelerating XML structural join by partitioning. in KV Andersen, J Debenham & R Wagner (eds), Lecture Notes in Computer Science. vol. 3588, pp. 280-289, 16th International Conference on Database and Expert Systems Applications, DExa 2005, Copenhagen, Denmark, 22/8/05.
Tang N, Yu JX, Wong KF, Lü K, Li J. Accelerating XML structural join by partitioning. In Andersen KV, Debenham J, Wagner R, editors, Lecture Notes in Computer Science. Vol. 3588. 2005. p. 280-289
Tang, Nan ; Yu, Jeffrey Xu ; Wong, Kam Fai ; Lü, Kevin ; Li, Jianxin. / Accelerating XML structural join by partitioning. Lecture Notes in Computer Science. editor / K.V. Andersen ; J. Debenham ; R. Wagner. Vol. 3588 2005. pp. 280-289
@inproceedings{ebb0416996054236bc16c708f32391ba,
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.",
author = "Nan Tang and Yu, {Jeffrey Xu} and Wong, {Kam Fai} and Kevin L{\"u} and Jianxin Li",
year = "2005",
language = "English",
volume = "3588",
pages = "280--289",
editor = "K.V. Andersen and J. Debenham and R. Wagner",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - Accelerating XML structural join by partitioning

AU - Tang, Nan

AU - Yu, Jeffrey Xu

AU - Wong, Kam Fai

AU - Lü, Kevin

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.

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.

UR - http://www.scopus.com/inward/record.url?scp=26844460162&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26844460162&partnerID=8YFLogxK

M3 - Conference contribution

VL - 3588

SP - 280

EP - 289

BT - Lecture Notes in Computer Science

A2 - Andersen, K.V.

A2 - Debenham, J.

A2 - Wagner, R.

ER -