Relational Data-Base Management Systems
ACM Computing Surveys (CSUR)
CODASYL Data-Base Management Systems
ACM Computing Surveys (CSUR)
A Comparison of the Relational and CODASYL Approaches to Data-Base Management
ACM Computing Surveys (CSUR)
A method for describing information required by the database design process
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
A technique for implementing a set processor
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
Resource space model, its design method and applications
Journal of Systems and Software
| Hi-index | 0.00 |
I think we have a discussion today; not a debate. Its real purpose is to increase our understanding of the basic concepts underlying data base structures and their models; to note the similarities and differences between them, and to determine their compatibility or the lack thereof. We are talking about concepts, not about implementations. The reason for all data base structuring is retrieval: retrieval for output, retrieval for decision-making, retrieval for updating. To pinpoint the object of retrieval we must intelligently select the “right” data—the correct single record, the correct group of records, and, in some sense, the correct sequence of records (in those situations where the sequence in which these records are seen is important). For accurate selection, dependent on the particular interests, needs, and requirements of a given person, we want a mechanism for readily defining records to be selected. We want a mechanism that will permit the data base to evolve as the enterprise and information systems change. We want a mechanism which will protect already existing investment in programs and report specifications, while the data base evolves. We want a mechanism which permits the reoptimization of the structure of stored data as things change.