Multiple join processing in data grid

Authors:
Donghua Yang;Qaisar Rasool;Zhenhuan Zhang
Affiliations:
School of Computer Science and Technology, Harbin Institute of Technology, China;School of Computer Science and Technology, Harbin Institute of Technology, China;Production Research & Engineering Institute of Daqing Oilfield Company, China
Venue:
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Year:
2006

Citing 4
Cited 0

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
A Pipeline N-Way Join Algorithm Based on the 2-Way Semijoin Program

IEEE Transactions on Knowledge and Data Engineering
Distributed Query Processing on the Grid

GRID '02 Proceedings of the Third International Workshop on Grid Computing
Join algorithm using multiple replicas in data grid

WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management

Quantified Score

Hi-index	0.04

Visualization

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.