Multiple join processing in data grid

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Yang, D., Rasool, Q., & Zhang, Z. (2006). Multiple join processing in data grid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3841 LNCS, pp. 793–799). https://doi.org/10.1007/11610113_75

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free