Conference Proceeding Article
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.
Databases and Information Systems
Data Management and Analytics
SIGMOD '93: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data: May 26-28, 1993, Washington, DC
City or Country
PANG, Hwee Hwa; CAREY, Michael J.; and LIVNY, Miron.
Partially preemptible hash joins. (1993). SIGMOD '93: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data: May 26-28, 1993, Washington, DC. 59-68. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/3660
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.