Implementation Techniques for Main Memory Database Systems.

Abstract

With the availability of very large, relatively inexpensive main memories, it is becoming possible to keep large databases resident in main memory. This paper considers the changes necessary to permit a relational database system to take advantage of large amounts of main memory. The authors evaluate AVL vs. B+- tree access methods for main memory databases, hash-based query processing strategies vs. sort-merge, and study recovery issues when most or all of the database fits in main memory. As expected, B+- 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. Keywords: Access; Algorithms. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 23, 1984
Accession Number
ADA168530

Entities

People

  • David J. Dewitt
  • Frank Olken
  • Leonard D. Shapiro
  • Michael R. Stonebraker
  • Randy H. Katz

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Availability
  • California
  • Computer Programming
  • Computers
  • Contracts
  • Database Management Systems
  • Databases
  • Hash Tables
  • Information Science
  • Recovery
  • Relational Databases
  • Trees (Data Structures)
  • Universities

Fields of Study

  • Engineering

Readers

  • Artificial Intelligence
  • Parallel and Distributed Computing.