Affiliation:
1. University of Wisconsin
2. University of California at Berkeley
3. Lawrence Berkeley Laboratory
4. North Dakota State University
Abstract
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
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Cited by
161 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. MonARCh: an actor based architecture for dynamic linked data monitoring;PeerJ Computer Science;2024-07-12
2. CPU and GPU Hash Joins on Skewed Data;2024 IEEE 40th International Conference on Data Engineering Workshops (ICDEW);2024-05-13
3. MM-DIRECT;The VLDB Journal;2024-03-27
4. More Modern B-Tree Techniques;Foundations and Trends® in Databases;2024
5. Cache-Efficient Top-k Aggregation over High Cardinality Large Datasets;Proceedings of the VLDB Endowment;2023-12