作者: David J DeWitt , Randy H Katz , Frank Olken , Leonard D Shapiro , Michael R Stonebraker
关键词:
摘要: With the availability of very large, relatively inexpensive main memories, it is becoming possible keep large databases resident in memory In this paper we consider changes necessary to permit a relational database system take advantage amounts We evaluate AVL vs B+-tree access methods for databases, hash-based query processing strategies sort-merge, and study recovery issues when most or all fits As expected, B+-trees are preferred storage mechanism unless more than 80--90% A somewhat surprising result that hash based advantageous situations