ACM Home Page
Please provide us with feedback. Feedback
Partially preemptible hash joins
Full text PdfPdf (1.42 MB)
Source International Conference on Management of Data archive
Proceedings of the 1993 ACM SIGMOD international conference on Management of data table of contents
Washington, D.C., United States
Pages: 59 - 68  
Year of Publication: 1993
ISBN:0-89791-592-5
Also published in ...
Authors
Hwee Hwa Pang  Computer Sciences Department, University of Wisconsin, Madison, Madison, WI
Michael J. Carey  Computer Sciences Department, University of Wisconsin, Madison, Madison, WI
Miron Livny  Computer Sciences Department, University of Wisconsin, Madison, Madison, WI
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 24,   Citation Count: 21
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/170035.170051
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Bitt88
 
Blas77
M. Blasgen, K. Eswaran, "Storage and Access in Relational Databases", IBM Systems Journal, 16(4), 1977.
DeWi84
 
DeWi90
 
Ferg93
 
Kits83
M. K.itsuregawa, H. Tanaka, T. Moto-oka, "Application of Hash to Data Base Machine and its Architecture", New Generation Computing, 1(1), 1983.
 
Kits89
Livn87
 
Livn90
M. Livny, "DeNet User's Guide", CS Dept., UW-Madison, 1990.
 
Naka88
 
Pang93
H, P#ngj M. C#r#y# M. Livny, "PartiMly Pr#mptibl# Ha#h Joins", CS Technical Report, UW-Madison, 1993.
 
REAL92
Real-Time Systems, 4(3), Special Issue on Real-Time Databases, 1992.
 
Ries78
D. Ries, R, Epstein, "Evaluation of Distributio4a Criteria for Distributed Database Systems", UCB/ERL Technical Report M78/22, UC Berkeley, 1978.
Shap86
Ston81
 
Teng84
J. Teng, R. Gumaer, "Managing IBM Database 2 Buffers to Maximize Performance", IBM Systems Journal, 23(2), 1984.
 
Zell90

CITED BY  21

Collaborative Colleagues:
Hwee Hwa Pang: colleagues
Michael J. Carey: colleagues
Miron Livny: colleagues