A BSTRA C T: With the availability of very large, relatively inexpen sive 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 pro cessing strategies vs. sort-merge, and study recovery issues when most or all of the database fits in main memory. As expected, B-f--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.
Since the 1980s, with the availability of very large, relatively inexpensive, main memory, it became possible to keep large databases resident in main memory REF , and concepts such as main memory database management systems (MMDBMS) became usual.
Implementation techniques for main memory database systems
SIGMOD '84
Computer Science