Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
Multi-disk management algorithms
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
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
An adaptive hash join algorithm for multiuser environments
Proceedings of the sixteenth international conference on Very large databases
Operating system support for database management
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
The Gamma Database Machine Project
IEEE Transactions on Knowledge and Data Engineering
Goal Oriented, Adaptive Transaction Routing for High Performance Transaction Processing Systems
PDIS '93 Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems
Hash-Partitioned Join Method Using Dynamic Destaging Strategy
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
ACM SIGMOD Record
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Managing memory for real-time queries
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Dynamic resource brokering for multi-user query execution
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Domain vector hashing for earth system data querying
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
Multiclass Query Scheduling in Real-Time Database Systems
IEEE Transactions on Knowledge and Data Engineering
Criss-Cross Hash Joins: Design and Analysis
IEEE Transactions on Knowledge and Data Engineering
Dynamic Memory Adjustment for External Mergesort
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Managing Memory to Meet Multiclass Workload Response Time Goals
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Memory-Adaptive External Sorting
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Memory-Contention Responsive Hash Joins
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Dynamic Multi-Resource Load Balancing in Parallel Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Adaptive Query Processing: A Survey
BNCOD 19 Proceedings of the 19th British National Conference on Databases: Advances in Databases
Sing the truth about ad hoc join costs
The VLDB Journal — The International Journal on Very Large Data Bases
Join algorithm costs revisited
The VLDB Journal — The International Journal on Very Large Data Bases
Handbook of massive data sets
A Theoretical Framework for Memory-Adaptive Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Adaptive self-tuning memory in DB2
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Physical Database Design: the database professional's guide to exploiting indexes, views, storage, and more
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Exploiting pipeline interruptions for efficient memory allocation
Proceedings of the 17th ACM conference on Information and knowledge management
| Hi-index | 0.00 |
With the advent of real-time and goal-oriented database systems, priority scheduling is likely to be an important feature in future database management systems. A consequence of priority scheduling is that a transaction may lose its buffers to higher-priority transactions, and may be given additional memory when transactions leave the system. Due to their heavy reliance on main memory, hash joins are especially vulnerable to fluctuations in memory availability. Previous studies have proposed modifications to the hash join algorithm to cope with these fluctuations, but the proposed algorithms have not been extensively evaluated or compared with each other. This paper contains a performance study of these algorithms. In addition, we introduce a family of memory-adaptive hash join algorithms that turns out to offer even better solutions to the memory fluctuation problem that hash joins experience.