A list-based storage for personal databases

  • Authors:
  • Rafiul Ahad

  • Affiliations:
  • Computer Science Department, University of Southern California, Los Angeles, CA

  • Venue:
  • Proceedings of the 1985 ACM SIGSMALL symposium on Small systems
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

A physical storage structure based on the List data structure is presented. The structure, along with the operations defined on it, is meant to serve as an internal model of a database system utilizing a semantic conceptual data model. The advantages of the List-based storage structure stem from its ability to: cluster the related data items arbitrarily; represent the entire database, i.e., storage structures, access structures, and schemata, in a uniform way using the same structure; reorganize the storage structures using well-defined operations on the structures; and incorporate basic integrity constraints at the storage structure level. The structure is particularly suitable for environments where the amount of structural information is large relative to the size of the database - a characterization that fits a personal information environment.The definition of the List-based structure, the operations defined for it, and an implementation technique are discussed.