Implementation Techniques For Main Memory Database Systems
Summary: Techniques for exploiting large main memory in relational DBMS; compare AVL vs B+-tree access, and hash-based vs sort-merge query processing, plus recovery when most data fits in memory. B+-trees preferred up to ~80–90% memory; hash methods become advantageous in large-memory regimes. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. David J. DeWitt (University of Wisconsin)
- 2. Randy H. Katz (University of California Berkeley)
- 3. Frank Olken (Lawrence Berkeley National Laboratory)
- 4. Leonard D. Shapiro (North Dakota State University)
- 5. Michael R. Stonebraker (University of California Berkeley)
- 6. David Wood (University of California Berkeley)
BibTeX Citation
@inproceedings{dewitt_sigmod84,
title = {{IMPLEMENTATION TECHNIQUES FOR MAIN MEMORY DATABASE SYSTEMS}},
author = {DeWitt, David J. and Katz, Randy H. and Olken, Frank and Shapiro, Leonard D. and Stonebraker, Michael R. and Wood, David},
series = {{SIGMOD} '84},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/602259.602261},
url = {https://dl.acm.org/doi/10.1145/602259.602261},
year = {1984}
}
Incoming Citations (Sorted by Pagerank)
Showing 47 of 147 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 320 | Evaluation of Database Access Paths | 1978 | SIGMOD | 0.00021373172 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,265 | An Experimental Comparison of Thirteen Relational Equi-Joins in Main Memory | 2016 | SIGMOD |
| 2 | 5,495 | Efficient Main Memory Data Management Using the DBGraph Storage Model | 1990 | VLDB |
| 3 | 2,116 | A Recovery Algorithm for A High-Performance Memory-Resident Database System | 1987 | SIGMOD |
| 4 | 423 | Massively Parallel Sort-Merge Joins in Main Memory Multi-Core Database Systems | 2012 | VLDB |
| 5 | 219 | A Study of Index Structures for Main Memory Database Management Systems | 1986 | VLDB |
| 6 | 5,715 | Design and Evaluation of Storage Organizations for Read-Optimized Main Memory Databases | 2013 | VLDB |
| 7 | 13,087 | Fast Search In Main Memory Databases | 1992 | SIGMOD |
| 8 | 360 | Design and Evaluation of Main Memory Hash Join Algorithms for Multi-core CPUs | 2011 | SIGMOD |
| 9 | 6,748 | The Effect Of Large Main Memory On Database Systems | 1986 | SIGMOD |
| 10 | 1,355 | Query Processing in Main Memory Database Management Systems | 1986 | SIGMOD |