A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
A characterization of globally consistent databases and their correct access paths
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
On the Equivalence of Database Models
Journal of the ACM (JACM)
Testing satisfaction of functional dependencies
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Design of relational views over network schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Can we use the universal instance assumption without using nulls?
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
A universal relation database system implemented via the network model
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Logical Design and Schema Conversion for Relational and DBTG Databases
Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design
ACM SIGMIS Database
Combining relational and network retrieval methods
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
LAURA: A Formal Data Model and her Logical Design Methodology
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
In this paper we address several problems relating to functional dependencies and network schemas. We investigate properties of the functional dependencies that are implicitly defined in a network schema. A definition for the satisfaction of functional dependencies by a network database is proposed, and then we give a sufficient condition for the global consistency of a network schema. A network schema is globally consistent if all its databases satisfy the functional dependencies that are implicitly defined in the schema. Finally, we describe a design methodology for producing a network schema whose set of implicitly defined functional dependencies implies a set of functional dependencies specified by the user.