An attribute-based file organization for a relational database

Authors:
Jay-Louise Weldon;Shamkant B. Navathe
Affiliations:
-;-
Venue:
ACM '76 Proceedings of the 1976 annual conference
Year:
1976

Citing 6
Cited 0

File organization: the consecutive retrieval property

Communications of the ACM
A formal system for information retrieval from files

Communications of the ACM
A relational model of data for large shared data banks

Communications of the ACM
Canonical structure in attribute based file organization

Communications of the ACM
A relational data base management system

ACM '72 Proceedings of the ACM annual conference - Volume 2
Specifying queries as relational expressions

SIGPLAN '73 Proceedings of the 1973 meeting on Programming languages and information retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

A file organization based on the work of Wong and Chiang (12) may be used to store a relational database which comprises several relations. In the proposed storage structure, keywords are defined on domains (other than primary key domains) and used to divide the file into disjoint subsets called Boolean atoms. Tuples in each Boolean atom are stored contiguously and identifiers for each atom are stored in a directory. The actual construction of the atom directory and the storage of the tuples are presented with an example. Procedures for processing queries against the proposed structure are illustrated using sample queries from SQUARE (1). A modification of the structure to accommodate ranges of values as keywords is also indicated.