The Architecture of SM3: A Dynamically Partitionable Multicomputer System
IEEE Transactions on Computers
Database processing on a cube-connected multicomputer
Database processing on a cube-connected multicomputer
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Response Time Analysis of Multiprocessor Computers for Database Support
ACM Transactions on Database Systems (TODS)
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
A back-end computer for data base management
Communications of the ACM
GAMMA - A High Performance Dataflow Database Machine
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
X-Tree: A tree structured multi-processor computer architecture
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Performance of join on an n-dimensional mesh
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Permutation-Based Range-Join Algorithms on N-Dimensional Meshes
IEEE Transactions on Parallel and Distributed Systems
Efficient Permutation-Based Range-Join Algorithms on N-Dimensional Meshes
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Hi-index | 0.00 |
In this paper, we compare the performance of two join algorithms on a cube and on a multidimensional mesh architectures. The algorithms are nested-loop and sort-merge joins. The study confirms that a higher connectivity architecture is faster and has a wider performance bandwidth. The sort-merge join algorithm is better for a small number of nodes, but it becomes worse than the nested-loop join algorithm as the number of nodes gets larger and the join selectivity gets large, especially for the simpler mesh architecture. The study also shows that the 3-dimensional mesh architecture has performance comparable to the more complicated cube architecture for the medium number of nodes in a system.