Database systems: The Intelligent Store: A content-addressable page manager

The Intelligent Store (IS) is a page manager for an experimental local computer network. Typical clients of the IS are a database manager or a file manager. The IS provides concurrent, transaction-oriented, read-write-search access to a large database of pages. The IS ensures that committing a transaction is atomic and permanent, in spite of crashes. The IS allows multiple, concurrent readers and writers. Rather than using conventional wait-until-available locking, the IS uses an optimistic locking policy. That is, the IS always allows transactions to proceed, assuming they will not interfere. If two transactions do interfere (e.g., if they both write the same page), the IS aborts one of them. This paper gives some analytic results for the interference probability. Two implementations of the IS exist. The first was designed to use one or more content-addressable disks. By reading all tracks in a cylinder in parallel, and filtering each stream, such a device can search an entire cylinder in one disk revolution. This version of the IS uses the content-addressable features internally, as well as making them available to its clients. Unfortunately, suitable content-addressable disks are not commercially available. Therefore, a second implementation of the IS was designed to use conventional disks. The two versions of the IS present the same interface to their clients, except that the conventional-disk IS does not provide search access.

[1]  David J. DeWitt,et al.  DIRECT - A Multiprocessor Organization for Supporting Relational Database Management Systems , 1979, IEEE Trans. Computers.

[2]  Krishnamurthi Kannan,et al.  The design of a mass memory for a database computer , 1978, ISCA '78.

[3]  Butler W. Lampson,et al.  Crash Recovery in a Distributed Data Storage System , 1981 .

[4]  J. T. Robinson,et al.  On optimistic methods for concurrency control , 1979, TODS.

[5]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[6]  Kenneth C. Smith,et al.  RAP.2—An Associative Processor for Databases and Its Applications , 1979, IEEE Transactions on Computers.

[7]  Stanley Y. W. Su,et al.  Cellular-Logic Devices: Concepts and Applications , 1979, Computer.

[8]  David Elliot Shaw A Relational Database Machine Architecture , 1980, CAW '80.

[9]  Jayanta Banerjee,et al.  Concepts and capabilities of a database computer\ , 1978, TODS.

[10]  David J. DeWitt,et al.  A PERFORMANCE EVALUATION OF DATABASE MACHINE ARCHITECTURES , 1981 .

[11]  D. J. De Witt,et al.  Direct—A Multiprocessor Organization for Supporting Relational Database Management Systems , 1979 .

[12]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.

[13]  G. Jack Lipovski,et al.  The Architectural Features and Implementation Techniques of the Multicell CASSM , 1979, IEEE Transactions on Computers.

[14]  Marvin H. Solomon,et al.  The Roscoe distributed operating system , 1979, SOSP '79.

[15]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[16]  Michael Stonebraker,et al.  Effects of locking granularity in a database management system , 1977, TODS.

[17]  Douglas S. Kerr Data Base Machines with Large Content-Addressable Blocks and Structural Information Processors , 1979, Computer.

[18]  Jayanta Banerjee,et al.  DBC—A Database Computer for Very Large Databases , 1979, IEEE Transactions on Computers.

[19]  Diane C. P. Smith,et al.  Relational Data Base Machines , 1979, Computer.

[20]  J. Mitchell,et al.  Issues in the design and use of a distributed file system , 1980, OPSR.

[21]  Glen G. Langdon,et al.  A note on associative processors for data management , 1978, TODS.

[22]  Michael Stonebraker,et al.  Locking granularity revisited , 1979, ACM Trans. Database Syst..

[23]  David J. DeWitt,et al.  A Performance Evaluation of Data Base Machine Architectures (Invited Paper) , 1981, VLDB.

[24]  Joost Verhofstad,et al.  Recovery Techniques for Database Systems , 1978, CSUR.

[25]  Forest Baskett,et al.  Task communication in DEMOS , 1977, SOSP '77.