Join processing in database systems with large main memories
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
Effect of skew on join performance in parallel architectures
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
A hash-based join algorithm for a cube-connected parallel computer
Information Processing Letters
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The effect of bucket size tuning in the dynamic hybrid GRACE hash join method
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
Parallel algorithms for the execution of relational database operations
ACM Transactions on Database Systems (TODS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers
IEEE Transactions on Knowledge and Data Engineering
Tree Structured Multiple Processor Join Methods
Proceedings of the Third International Conference on Data Engineering
Query Execution for Large Relations on Functional Disk Systems
Proceedings of the Fifth International Conference on Data Engineering
Limiting Factors of Join Performance on Parallel Processors
Proceedings of the Fifth International Conference on Data Engineering
Implementing Relational Database Operations in a Cube-Connected Multicomputer System
Proceedings of the Third International Conference on Data Engineering
GAMMA - A High Performance Dataflow Database Machine
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Hash-Partitioned Join Method Using Dynamic Destaging Strategy
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Algorithms for loading parallel grid files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
A Symmetric Fragment and Replicate Algorithm for Distributed Joinsyout
IEEE Transactions on Parallel and Distributed Systems
Parallel Execution of Hash Joins in Parallel Databases
IEEE Transactions on Parallel and Distributed Systems
An Adaptive Parallel Distributive Join Algorithm on a Cluster of Workstations
The Journal of Supercomputing
Site and Query Scheduling Policies in Multicomputer Database Systems
IEEE Transactions on Knowledge and Data Engineering
Efficient Processing of Nested Fuzzy SQL Queries in a Fuzzy Database
IEEE Transactions on Knowledge and Data Engineering
Join algorithm costs revisited
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
The cube adaptive-hash join algorithm, which combines the merits of nested-loop and hybrid-hash, is presented. The performance of these algorithms is compared through analytical cost modeling. The nonuniform data value distribution of the inner relation is shown to have a greater impact than that of the outer relation. The cube adaptive-hash algorithm outperforms the cube hybrid-hash algorithm when bucket overflow occurs. In the worst case, this algorithm converges to the cube nested-loop-hash algorithm. When there is no hash table overflow, the cube adaptive-hash algorithm converges to the cube hybrid-hash algorithm. Since the cube adaptive-hash algorithm adapts itself depending on the characteristics of the relations, it is relatively immune to the data distribution.