Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Design and evaluation of parallel pipelined join algorithms
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Database computers: principle, architectures & techniques
Database computers: principle, architectures & techniques
A hash-based join algorithm for a cube-connected parallel computer
Information Processing Letters
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
Approximating block accesses in database organizations
Communications of the ACM
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Tree Structured Multiple Processor Join Methods
Proceedings of the Third International Conference on Data Engineering
Implementing Relational Database Operations in a Cube-Connected Multicomputer System
Proceedings of the Third International Conference on Data Engineering
An Overview of The System Software of A Parallel Relational Database Machine GRACE
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
GAMMA - A High Performance Dataflow Database Machine
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Join processing in relational databases
ACM Computing Surveys (CSUR)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Dynamic Load Balancing in Very Large Shared-Nothing Hypercube Database Computers
IEEE Transactions on Computers
Inverted File Partitioning Schemes in Multiple Disk Systems
IEEE Transactions on Parallel and Distributed Systems
A Parallel Distributive Join Algorithm for Cube-Connected Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Adaptive Join Algorithms in Dynamic Distributed Databases
Distributed and Parallel Databases
Parallel Distributive Join Algorithm on the Intel Paragon
The Journal of Supercomputing
An Adaptive Parallel Distributive Join Algorithm on a Cluster of Workstations
The Journal of Supercomputing
Large Join Optimization on a Hypercube Multiprocessor
IEEE Transactions on Knowledge and Data Engineering
Site and Query Scheduling Policies in Multicomputer Database Systems
IEEE Transactions on Knowledge and Data Engineering
Parallel Hash-Based Join Algorithms for a Shared-Everything Environment
IEEE Transactions on Knowledge and Data Engineering
Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins
IEEE Transactions on Knowledge and Data Engineering
Optimization of Parallel Execution for Multi-Join Queries
IEEE Transactions on Knowledge and Data Engineering
A Parallel Algorithm for Relational Database Normalization
IEEE Transactions on Parallel and Distributed Systems
The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer
IEEE Transactions on Parallel and Distributed Systems
Distributed Load Balancing for Parallel Main Memory Hash Join
IEEE Transactions on Parallel and Distributed Systems
Join and Data Redistribution Algorithms for Hypercubes
IEEE Transactions on Knowledge and Data Engineering
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Performance Analysis of a Load Balancing Hash-Join Algorithm for a Shared Memory Multiprocessor
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
The authors compare the performance of two join algorithms on both cube and ring interconnections for message-based multicomputers, and investigate the effects that the number of processors and the type of interconnection scheme have on the performance. First, the parallel hybrid-hash join algorithm and the parallel join-index join algorithm for both the cube and ring connected multicomputers are presented. The performance of these algorithms is then compared through analytical cost modeling. The result shows that the join-index join algorithm gives good performance only when the join selectivity is very small, and the hybrid-hash join algorithm performs consistently well under most situations. It is shown that the cube topology yields better execution time than the same algorithm on the ring topology. Furthermore, increasing the number of processors has a more significant improvement on the execution time of the cube than for the ring configuration. The applicability of join indexes on the parallel database algorithms is also discussed.