Skip to main navigation Skip to search Skip to main content

Multiple join processing in data grid

  • Donghua Yang*
  • , Qaisar Rasool
  • , Zhenhuan Zhang
  • *Corresponding author for this work
  • School of Computer Science and Technology, Harbin Institute of Technology
  • Daqing Oilfield Company Ltd.

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

Abstract

In this paper, we undertake the problem of multiple join operations in data grid environment. To get convenience in data transference among grid nodes, we propose an n-way relation-reduction algorithm that reduces the relation tuples before the execution of join operation, A new method is developed that can accurately estimate the cardinalities of the join results in each step. The experiments and analytical results depict the effectiveness of the proposed multiple join algorithm for minimizing the total amount of data transmission, parallel and efficient joining of the data to improve query responses in data grid.

Original languageEnglish
Title of host publicationFrontiers of WWW Research and Development - APWeb 2006 - 8th Asia-Pacific Web Conference, Proceedings
Pages793-799
Number of pages7
DOIs
StatePublished - 2006
Externally publishedYes
Event8th Asia-Pacific Web Conference, APWeb 2006: Frontiers of WWW Research and Development - Harbin, China
Duration: 16 Jan 200618 Jan 2006

Publication series

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

Conference

Conference8th Asia-Pacific Web Conference, APWeb 2006: Frontiers of WWW Research and Development
Country/TerritoryChina
CityHarbin
Period16/01/0618/01/06

Fingerprint

Dive into the research topics of 'Multiple join processing in data grid'. Together they form a unique fingerprint.

Cite this