A simple and efficient implementation of a small database

  • Authors:

  • A. Birrell;M. Jones;E. Wobber

  • Affiliations:

  • DEC Systems Research Center, Palo Alto, CA;DEC Systems Research Center, Palo Alto, CA;Carnegie Mellon Univ., Pittsburgh, PA

  • Venue:
  • SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes a technique for implementing the sort of small databases that frequently occur in the design of operating systems and distributed systems. We take advantage of the existence of very large virtual memories, and quite large real memories, to make the technique feasible. We maintain the database as a strongly typed data structure in virtual memory, record updates incrementally on disk in a log and occasionally make a checkpoint of the entire database. We recover from crashes by restoring the database from an old checkpoint then replaying the log. We use existing packages to convert between strongly typed data objects and their disk representations, and to communicate strongly typed data across the network (using remote procedure calls). Our memory is managed entirely by a general purpose allocator and garbage collector. This scheme has been used to implement a name server for a distributed system. The resulting implementation has the desirable property of being simultaneously simple, efficient and reliable.