Parallelism in relational data base systems: architectural issues and design approaches
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Parallel algorithms for the execution of relational database operations
ACM Transactions on Database Systems (TODS)
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Mariposa: A New Architecture for Distributed Data
Proceedings of the Tenth International Conference on Data Engineering
A parallel hash-based join algorithm for a networked cluster of multiprocessor nodes
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Cluster Based Hybrid Hash Join: Analysis and Evaluation
CLUSTER '02 Proceedings of the IEEE International Conference on Cluster Computing
Analysis and Evaluation of Sorting on Hypercube-Based Systems
PDP '96 Proceedings of the 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96)
Hi-index | 0.00 |
We developed a concise but comprehensive analytical model for the well-known sort merge Join algorithm on cost effective cluster architectures. We try to concentrate on a limited number of characteristic parameters to keep the analytical model clear and focused. We believe that a meaningful model can be built upon only three characteristic parameter sets, describing main memory size, the I/O bandwidth and the disk bandwidth. We justify our approach by a practical implementation and a comparison of the theoretical to real performance values.