An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
Relational Data-Base Management Systems
ACM Computing Surveys (CSUR)
CODASYL Data-Base Management Systems
ACM Computing Surveys (CSUR)
A relational model of data for large shared data banks
Communications of the ACM
File-level operations on network data structures
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
NUL: a Navigational User's Language for a network structured data base
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Implications of data independence on the architecture of database management systems
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
Interactive support for non-programmers: The relational and network approaches
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational
On the equivalences of data based systems
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational
The relational and network approaches: Comparison of the application programming interfaces
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational
ACM SIGMIS Database
Semantics of query languages for network databases
ACM Transactions on Database Systems (TODS)
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
| Hi-index | 0.00 |
A data model is presented, based on the extension of the concept of a DBTG owner-coupled set to permit static and dynamic sets and a new kind of set referred to as a virtual set. The notion of connection fields is introduced, and it is shown how connection fields may be used to construct derived information bearing set names, and hence permit the specification of (dynamic) sets which are not predeclared in a schema. Virtual sets are shown to reflect the functional dependencies which can exist within a file. A technique which permits the data model to be fully described diagrammatically by extended Bachman diagrams is described. A predicate calculus for manipulation of this data model is presented. Expressions written in this calculus are compared with corresponding expressions in a relational predicate calculus, DSL ALPHA. An argument for the relational completeness of the language is given.