A Study of Index Structures for
Main Memory Database Management Systems
Tobin J. Lehman Michael J. Carey
Computer Sciences Department
University of Wisconsin Madison,
One approach to achieving high performance in a database management system is to store the database in main memorv rather than on disk. One can then design new data structures aid algorithms oriented towards making eflicient use of CPU cycles and memory space rather than minimizing disk accesses and &ing disk space efliciently. In this paper we present some results on index structures from an ongoing study of main memory database management systems. We propose a new index structure, the T Tree, and we compare it to existing index structures in a main memory database environment. Our results indicate that the T Tree provides good overall performance in main memory.