Parallel structural join algorithms

Jian Xin Li, Guo Ren Wang, Nan Tang, Bin Wang, Ya Xin Yu, Hai Ning Zhang

Research output: Contribution to journalArticle

Abstract

Join operation is the most expendable operation as well as the most universal operation in database system. The main join operation is equi-join operation in traditional database systems, and previous work about parallel join mainly focuses on the equi-join operation. In addition, with the growing importance of XML in Web applications, XML has become the new standard for data exchange over Internet. Unlike the equi-join in traditional databases, the join operation about XML belongs to structural join operation. Previous parallel join algorithms that are suitable to equi-join cannot solve structural join problems. Therefore, the problem of parallel structural join is proposed for the first time. Also proposed in this paper are two parallel structural join algorithms, equal high histogram join algorithm and equal breadth histogram join algorithm, that are proposed by utilizing histogram on parallel join. Experimental results indicate that both algorithms can improve the performance of structural joins.

Original languageEnglish
Pages (from-to)1768-1773
Number of pages6
JournalJisuanji Yanjiu yu Fazhan/Computer Research and Development
Volume41
Issue number10
Publication statusPublished - 1 Oct 2004
Externally publishedYes

Fingerprint

XML
Electronic data interchange
Parallel algorithms
World Wide Web
Internet

Keywords

  • Histogram
  • Parallel structural join
  • XML

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Li, J. X., Wang, G. R., Tang, N., Wang, B., Yu, Y. X., & Zhang, H. N. (2004). Parallel structural join algorithms. Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 41(10), 1768-1773.

Parallel structural join algorithms. / Li, Jian Xin; Wang, Guo Ren; Tang, Nan; Wang, Bin; Yu, Ya Xin; Zhang, Hai Ning.

In: Jisuanji Yanjiu yu Fazhan/Computer Research and Development, Vol. 41, No. 10, 01.10.2004, p. 1768-1773.

Research output: Contribution to journalArticle

Li, JX, Wang, GR, Tang, N, Wang, B, Yu, YX & Zhang, HN 2004, 'Parallel structural join algorithms', Jisuanji Yanjiu yu Fazhan/Computer Research and Development, vol. 41, no. 10, pp. 1768-1773.
Li JX, Wang GR, Tang N, Wang B, Yu YX, Zhang HN. Parallel structural join algorithms. Jisuanji Yanjiu yu Fazhan/Computer Research and Development. 2004 Oct 1;41(10):1768-1773.
Li, Jian Xin ; Wang, Guo Ren ; Tang, Nan ; Wang, Bin ; Yu, Ya Xin ; Zhang, Hai Ning. / Parallel structural join algorithms. In: Jisuanji Yanjiu yu Fazhan/Computer Research and Development. 2004 ; Vol. 41, No. 10. pp. 1768-1773.
@article{7f7d1c4beead4d2986980e8ebd60d13f,
title = "Parallel structural join algorithms",
abstract = "Join operation is the most expendable operation as well as the most universal operation in database system. The main join operation is equi-join operation in traditional database systems, and previous work about parallel join mainly focuses on the equi-join operation. In addition, with the growing importance of XML in Web applications, XML has become the new standard for data exchange over Internet. Unlike the equi-join in traditional databases, the join operation about XML belongs to structural join operation. Previous parallel join algorithms that are suitable to equi-join cannot solve structural join problems. Therefore, the problem of parallel structural join is proposed for the first time. Also proposed in this paper are two parallel structural join algorithms, equal high histogram join algorithm and equal breadth histogram join algorithm, that are proposed by utilizing histogram on parallel join. Experimental results indicate that both algorithms can improve the performance of structural joins.",
keywords = "Histogram, Parallel structural join, XML",
author = "Li, {Jian Xin} and Wang, {Guo Ren} and Nan Tang and Bin Wang and Yu, {Ya Xin} and Zhang, {Hai Ning}",
year = "2004",
month = "10",
day = "1",
language = "English",
volume = "41",
pages = "1768--1773",
journal = "Jisuanji Yanjiu yu Fazhan/Computer Research and Development",
issn = "1000-1239",
publisher = "Science Press",
number = "10",

}

TY - JOUR

T1 - Parallel structural join algorithms

AU - Li, Jian Xin

AU - Wang, Guo Ren

AU - Tang, Nan

AU - Wang, Bin

AU - Yu, Ya Xin

AU - Zhang, Hai Ning

PY - 2004/10/1

Y1 - 2004/10/1

N2 - Join operation is the most expendable operation as well as the most universal operation in database system. The main join operation is equi-join operation in traditional database systems, and previous work about parallel join mainly focuses on the equi-join operation. In addition, with the growing importance of XML in Web applications, XML has become the new standard for data exchange over Internet. Unlike the equi-join in traditional databases, the join operation about XML belongs to structural join operation. Previous parallel join algorithms that are suitable to equi-join cannot solve structural join problems. Therefore, the problem of parallel structural join is proposed for the first time. Also proposed in this paper are two parallel structural join algorithms, equal high histogram join algorithm and equal breadth histogram join algorithm, that are proposed by utilizing histogram on parallel join. Experimental results indicate that both algorithms can improve the performance of structural joins.

AB - Join operation is the most expendable operation as well as the most universal operation in database system. The main join operation is equi-join operation in traditional database systems, and previous work about parallel join mainly focuses on the equi-join operation. In addition, with the growing importance of XML in Web applications, XML has become the new standard for data exchange over Internet. Unlike the equi-join in traditional databases, the join operation about XML belongs to structural join operation. Previous parallel join algorithms that are suitable to equi-join cannot solve structural join problems. Therefore, the problem of parallel structural join is proposed for the first time. Also proposed in this paper are two parallel structural join algorithms, equal high histogram join algorithm and equal breadth histogram join algorithm, that are proposed by utilizing histogram on parallel join. Experimental results indicate that both algorithms can improve the performance of structural joins.

KW - Histogram

KW - Parallel structural join

KW - XML

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

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

M3 - Article

AN - SCOPUS:8844239323

VL - 41

SP - 1768

EP - 1773

JO - Jisuanji Yanjiu yu Fazhan/Computer Research and Development

JF - Jisuanji Yanjiu yu Fazhan/Computer Research and Development

SN - 1000-1239

IS - 10

ER -