| Partially preemptible hash joins |
| Full text |
Pdf
(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 |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 7, Downloads (12 Months): 24, Citation Count: 21
|
|
|
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
|
David J DeWitt , Randy H Katz , Frank Olken , Leonard D Shapiro , Michael R Stonebraker , David Wood, Implementation techniques for main memory database systems, Proceedings of the 1984 ACM SIGMOD international conference on Management of data, June 18-21, 1984, Boston, Massachusetts
|
| |
DeWi90
|
D. J. Dewitt , S. Ghandeharizadeh , D. A. Schneider , A. Bricker , H. -I. Hsiao , R. Rasmussen, The Gamma Database Machine Project, IEEE Transactions on Knowledge and Data Engineering, v.2 n.1, p.44-62, March 1990
[doi> 10.1109/69.50905]
|
| |
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
|
Miron Livny , Setrag Khoshafian , Haran Boral, Multi-disk management algorithms, Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems, p.69-77, May 11-14, 1987, Banff, Alberta, Canada
|
| |
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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adam J. Storm , Christian Garcia-Arellano , Sam S. Lightstone , Yixin Diao , M. Surendra, Adaptive self-tuning memory in DB2, Proceedings of the 32nd international conference on Very large data bases, September 12-15, 2006, Seoul, Korea
|
|
|
Gerhard Weikum , Axel Moenkeberg , Christof Hasse , Peter Zabback, Self-tuning database technology and information services: from wishful thinking to viable engineering, Proceedings of the 28th international conference on Very Large Data Bases, p.20-31, August 20-23, 2002, Hong Kong, China
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Josep Aguilar-Saborit , Mohammad Jalali , Dave Sharpe , Victor Muntés Mulero, Exploiting pipeline interruptions for efficient memory allocation, Proceeding of the 17th ACM conference on Information and knowledge management, October 26-30, 2008, Napa Valley, California, USA
|
|