Affordable Access

Publisher Website

Distributed multi-join query processing in data grids

Authors
Journal
Information Sciences
0020-0255
Publisher
Elsevier
Publication Date
Volume
177
Issue
17
Identifiers
DOI: 10.1016/j.ins.2007.03.001
Keywords
  • Data Grids
  • Multi-Join Query Processing
  • Relation–Reduction Algorithm
  • Minimum–Maximum-Edge Matching
Disciplines
  • Computer Science

Abstract

Abstract Query processing in data grids is a difficult issue due to the heterogeneous, unpredictable and volatile behaviors of the grid resources. Applying join operations on remote relations in data grids is a unique and interesting problem. However, to the best of our knowledge, little is done to date on multi-join query processing in data grids. An approach for processing multi-join queries is proposed in this paper. Firstly, a relation–reduction algorithm for reducing the sizes of operand relations is presented in order to minimize data transmission cost among grid nodes. Then, a method for scheduling computer nodes in data grids is devised to parallel process multi-join queries. Thirdly, an innovative method is developed to efficiently execute join operations in a pipeline fashion. Finally, a complete algorithm for processing multi-join queries is given. Analytical and experimental results show the effectiveness and efficiency of the proposed approach.

There are no comments yet on this publication. Be the first to share your thoughts.