Implementation techniques for main memory database systems
David J. DeWitt, Randy Howard Katz, Frank Olken et al. · Proceedings - ACM-SIGMOD International Conference on Management of Data · 1984
With the availability of very large, relatively inexpensive main memories, 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 advantageous for large memory situations
Cited by 809 works. doi:10.1145/602259.602261 Open-access PDF
Authors
References
- Introduction to Database Systems
- Access path selection in a relational database management system
- Ubiquitous B-Tree
- Implementing atomic actions on decentralized data
- The Recovery Manager of the System R Database Manager
- Implementing a relational database by means of specialzed hardware
- Storage and access in relational data bases
- Application of hash to data base machine and its architecture
- Introduction to Database Systems
- An investigation of multiprocessor structures and algorithms for data base management