Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
5-1993
Abstract
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.
Discipline
Databases and Information Systems
Publication
SIGMOD '93: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data: May 26-28, 1993, Washington, DC
First Page
59
Last Page
68
ISBN
9780897915922
Identifier
10.1145/170036.170051
Publisher
ACM
City or Country
New York
Embargo Period
7-10-2017
Citation
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.
Available at: https://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 International License.
Additional URL
http://doi.org/10.1145/170036.170051