Skip to main navigation Skip to search Skip to main content

Efficient join algorithms for integrating XML data in grid environment

  • Hongzhi Wang*
  • , Jianzhong Li
  • , Shuguang Xiong
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

For its self-description feature, XML can be used to represent information in grid environment. Querying XML data distributed in grid environment brings new challenges. In this paper, we focus on join algorithms in result merge step of query processing. In order to transmit results efficiently, we present strategies of data compacting, as well as 4 join operator models. Based on the compacted data structure, we design efficient algorithms of these join operators. Extensive experimental results shows that our data compact strategy is effective; our join algorithms outperform XJoin significantly and have good scalability.

Original languageEnglish
Title of host publicationGrid and Cooperative Computing - GCC 2005 - 4th International Conference, Proceedings
PublisherSpringer Verlag
Pages547-553
Number of pages7
ISBN (Print)3540305106, 9783540305101
DOIs
StatePublished - 2005
Event4th International Conference on Grid and Cooperative Computing - GCC 2005 - Beijing, China
Duration: 30 Nov 20053 Dec 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3795 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Grid and Cooperative Computing - GCC 2005
Country/TerritoryChina
CityBeijing
Period30/11/053/12/05

Fingerprint

Dive into the research topics of 'Efficient join algorithms for integrating XML data in grid environment'. Together they form a unique fingerprint.

Cite this