Implementation of the ADAMS Database System

Report
Authors:Pfaltz, JL, Institute for Parallel ComputationUniversity of Virginia French, JC, Institute for Parallel ComputationUniversity of Virginia Grimshaw, A, Institute for Parallel ComputationUniversity of Virginia Son, SH, Institute for Parallel ComputationUniversity of Virginia Baron, P, Institute for Parallel ComputationUniversity of Virginia Janet, S, Institute for Parallel ComputationUniversity of Virginia Lin, Y, Institute for Parallel ComputationUniversity of Virginia Lloyd, L, Institute for Parallel ComputationUniversity of Virginia McElrath, R, Institute for Parallel ComputationUniversity of Virginia
Abstract:

ADAMS provides a mechanism for applications programs, written in many languages, to define and access common persistent databases. The basic constructs are element, class, set, map, attribute, and codomain. From these the user may define new data structures and new data classes belonging to a semantic hierarchy that supports multiple inheritance. This report describes the prototype implementation of ADAMS. Several features of interest include: the way a shared persistent name space has been captured in a dictionary structure, the implementation of a preprocessor which embeds runtime C++ proceses into host application programs written in standard C, the implementation of an object based uniqueid for all ADAMS elements, a single functional O-tree operator to represent sets, maps, and attributes, and a low-level storage operator to distribute data items to multiple storage devices.
Note: Abstract extracted from PDF text

Rights:
All rights reserved (no additional license for public reuse)
Language:
English
Source Citation:

Pfaltz, JL, JC French, A Grimshaw, SH Son, P Baron, S Janet, Y Lin, L Lloyd, and R McElrath. "Implementation of the ADAMS Database System." University of Virginia Institute for Parallel Computation Tech Report (1989).

Publisher:
University of Virginia, Institute for Parallel Computation
Published Date:
1989