Relational database systems
Semantic database modeling: survey, applications, and research issues
ACM Computing Surveys (CSUR)
Computational problems related to the design of normal form relational schemas
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
Unit Refutations and Horn Sets
Journal of the ACM (JACM)
An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
Journal of the ACM (JACM)
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Entity-Relationship Modeling: Foundations of Database Technology
Entity-Relationship Modeling: Foundations of Database Technology
ACM SIGMOD Record
Bioinformatics Adventures in Database Research
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Achievements of Relational Database Schema Design Theory Revisited
Selected Papers from a Workshop on Semantics in Databases
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
Theoretical Computer Science - Logic, language, information and computation
| Hi-index | 0.00 |
We extend Fagin's result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds for functional dependencies in databases that support complex values via nesting of records, lists, sets and multisets.The equivalence has several implications. Firstly, it extends a well-known result from relational databases to databases which are not in first normal form. Secondly, it characterises the implication of functional dependencies in complex-value databases in purely logical terms. The database designer can take advantage of this equivalence to reduce database design problems to simpler problems in propositional logic. An algorithm is presented for such an application. Furthermore, relational database design tools can be reused to solve problems for complex-value databases.