Storage reduction in relational database systems using spanning trees and other graph theoretic methods

Abstract

There are three major configurations for data base systems: the network approach, the hierarchical approach, and the relational approach [4]. At present two of these are commercially available. The network approach (as proposed and developed by CODASYL, the conference on data systems languages) has been implemented in Sperry Univac's DMS ii00, Honeywell's IDS, Cullinane's IDMS, Cincom's TOTAL and others. The hierarchical approach has been implemented by IBM in its Information Management System (IMS), MRI's System 2000, and others. The third approach is essentially in the research and exploratory development stage. Some prototypes of the relational approach, IBM's System R and INGRES, have been developed and tested [2], but mainly for research and study purposes.