Deletion in a relational data base defined on a non-redundant data model

Authors:
Marc Oldham
Affiliations:
TRW Financial Software, Orlando, Florida
Venue:
ACM-SE 17 Proceedings of the 17th annual Southeast regional conference
Year:
1979

Citing 4
Cited 0

Implementation of a structured English query language

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

Communications of the ACM
SEQUEL: A structured English query language

SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
Towards the design and implementation of a unified data base management system.

Towards the design and implementation of a unified data base management system.

Quantified Score

Hi-index	0.00

Visualization

Abstract

A compller for a relational language, called MENTAT, has been described and implemented. This compiler takes the high level language of MENTAT and translates it into an intermediate language which allows a user to create, traverse, and obtain data from a physical data model. The data model is constructed to provide a level of non-redundancy within the elements of the relation. However, this structure posed significant problems when attempts were made to produce a deletion algorithm for it. This paper provides a detailed description of the deletion algorithm.