Design and performance evaluation of a main memory relational database system
Most previous work in the area of main memory database systems has focused on the problem of developing techniques that work well with a very large buffer pool. This dissertation addresses the problems of database architecture design, query processing, concurrency control, and recovery for a memory resident relational database, an environment with a very different set of costs and priorities. An architecture for a memory-resident database system is presented, along with a discussion of the differences between memory resident database systems and conventional disk-based database systems. Index structures are then studied for a memory resident database environment. The T Tree, a new index structure designed for use in this environment, is introduced and compared with several existing index structures; It is shown to perform well in a memory-resident environment. Recovering a memory-resident database is different from recovering a disk-oriented database, so a different approach is taken in this dissertation. Existing proposals for memory-resident database recovery treat the database as a single entity, so recovery and checkpoint operations are applied to the entire database. A new design is proposed that allows logging, checkpointing, and recovery to be done at the relation or index level.
- Research Organization:
- Case Western Reserve Univ., Cleveland, OH (USA)
- OSTI ID:
- 6676682
- Resource Relation:
- Other Information: Thesis (Ph. D.)
- Country of Publication:
- United States
- Language:
- English
Similar Records
Main memory database algorithms for multiprocessors
Main-memory data-base algorithms for multiprocessors