Novel parallel join algorithms for grid files

Authors:
S. Mohammed;B. Srinivasan;M. Bozyigit;Phu Dung Le
Affiliations:
-;-;-;-
Venue:
HIPC '96 Proceedings of the Third International Conference on High-Performance Computing (HiPC '96)
Year:
1996

Citing 0
Cited 3

Distributed mining of classification rules

Knowledge and Information Systems
In-memory grid files on graphics processors

DaMoN '07 Proceedings of the 3rd international workshop on Data management on new hardware
Semi-join computation on distributed file systems using map-reduce-merge model

Proceedings of the 2010 ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The present advances in parallel and distributed processing and its application to database operations such as join resulted in investigating parallel algorithms. Hash based join algorithms involve a costly data partitioning phase prior to the join operation. This paper presents new parallel join algorithms for relations based on grid files where no costly partitioning phase is involved, hence the performance can improve.