Communications of the ACM - Special section on computer architecture
The iPSC/2 direct-connect communications technology
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Computer networks
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Database Operations in a Cube-Connected Multicomputer System
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
A VLSI Architecture for Concurrent Data Structures
A VLSI Architecture for Concurrent Data Structures
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers
IEEE Transactions on Knowledge and Data Engineering
Prototyping Bubba, A Highly Parallel Database System
IEEE Transactions on Knowledge and Data Engineering
The Gamma Database Machine Project
IEEE Transactions on Knowledge and Data Engineering
Effectiveness of Parallel Joins
IEEE Transactions on Knowledge and Data Engineering
The Development of the CROSS8 and HC16-186 Parallel (Database) Computers
IWDM '89 Proceedings of the Sixth International Workshop on Database Machines
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
IBM Systems Journal
Site and Query Scheduling Policies in Multicomputer Database Systems
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
An important aspect of database processing in parallel computer systems is the use of data parallel algorithms. Several parallel algorithms for the relational database join operation in a hypercube multicomputer system are given. The join algorithms are classified as cycling or global partitioning based on the tuple distribution method employed. The various algorithms are compared under a common framework, using time complexity analysis as well as an implementation on a 64-node NCUBE hypercube system. In general, the global partitioning algorithms demonstrate better speedup. However, the cycling algorithm can perform better than the global algorithms in specific situations, viz., when the difference in input relation cardinalities is large and the hypercube dimension is small. The usefulness of the data redistribution operation in improving the performance of the join algorithms, in the presence of uneven data partitions, is examined. The results indicate that redistribution significantly decreases the join algorithm execution times for unbalanced partitions.