Implementation Techniques for Main Memory Database Systems.
David J. DeWitt, Randy H. Katz, Frank Olken, Leonard D. Shapiro, Michael Stonebraker, David A. Wood:
Implementation Techniques for Main Memory Database Systems.
SIGMOD Conference 1984: 1-8@inproceedings{DBLP:conf/sigmod/DeWittKOSSW84,
author = {David J. DeWitt and
Randy H. Katz and
Frank Olken and
Leonard D. Shapiro and
Michael Stonebraker and
David A. Wood},
editor = {Beatrice Yormark},
title = {Implementation Techniques for Main Memory Database Systems},
booktitle = {SIGMOD'84, Proceedings of Annual Meeting, Boston, Massachusetts,
June 18-21, 1984},
publisher = {ACM Press},
year = {1984},
pages = {1-8},
ee = {http://doi.acm.org/10.1145/602259.602261, db/conf/sigmod/DeWittKOSSW84.html},
crossref = {DBLP:conf/sigmod/84},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
With the availability of very large, relatively inexpensive
main memorry, it is becoming possible keep large databases
resident in main memory. In this paper we consider the changes
necessary to permit a relational database system to take advantage
of large amounts of main memory. We evaluate AVL vs B+-tree
access methods for main memory databases, hash-based query processing
strategies vs sort-merge, and study recovery issues when
most or all of the database fits in main memory. As expected, B+-trees
are the preferred storage mechanism unless more than 80-90%
of the database fits in main memory. A somewhat surprising result is
that hash based query processing strategies are an advantageous for
large memory situations.
Copyright © 1984 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
Online Version (ACM WWW Account required): Full Text in PDF Format
CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Beatrice Yormark (Ed.):
SIGMOD'84, Proceedings of Annual Meeting, Boston, Massachusetts, June 18-21, 1984.
ACM Press 1984 ,
SIGMOD Record 14(2)
Contents
References
- [BABB79]
- Edward Babb:
Implementing a Relational Database by Means of Specialized Hardware.
ACM Trans. Database Syst. 4(1): 1-29(1979)
- [BLAS77]
- Mike W. Blasgen, Kapali P. Eswaran:
Storage and Access in Relational Data Bases.
IBM Systems Journal 16(4): 362-377(1977)
- [CESA82]
- Francesca Cesarini, Giovanni Soda:
Binary trees paging.
Inf. Syst. 7(4): 337-344(1982)
- [COME79]
- Douglas Comer:
The Ubiquitous B-Tree.
ACM Comput. Surv. 11(2): 121-137(1979)
- [DATE82]
- ...
- [GOOD81]
- ...
- [GRAY81]
- Jim Gray, Paul R. McJones, Mike W. Blasgen, Bruce G. Lindsay, Raymond A. Lorie, Thomas G. Price, Gianfranco R. Putzolu, Irving L. Traiger:
The Recovery Manager of the System R Database Manager.
ACM Comput. Surv. 13(2): 223-243(1981)
- [KNUT73]
- Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching.
Addison-Wesley 1973, ISBN 0-201-03803-X
- [KITS83]
- Masaru Kitsuregawa, Hidehiko Tanaka, Tohru Moto-Oka:
Application of Hash to Data Base Machine and Its Architecture.
New Generation Comput. 1(1): 63-74(1983)
- [MUNT70]
- ...
- [REED83]
- David P. Reed:
Implementing Atomic Actions on Decentralized Data.
ACM Trans. Comput. Syst. 1(1): 3-23(1983)
- [SELI79]
- Patricia G. Selinger, Morton M. Astrahan, Donald D. Chamberlin, Raymond A. Lorie, Thomas G. Price:
Access Path Selection in a Relational Database Management System.
SIGMOD Conference 1979: 23-34
- [YAO78]
- S. Bing Yao, D. DeJong:
Evaluation of Database Access Paths.
SIGMOD Conference 1978: 66-77
Copyright © Sun Mar 14 23:25:32 2010
by Michael Ley (ley@uni-trier.de)