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

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.