An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
On the design of relational database schemata
ACM Transactions on Database Systems (TODS)
Normalization and hierarchical dependencies in the relational data model
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Database abstractions: aggregation and generalization
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Computing covers for embedded functional dependencies
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems (TODS)
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
Journal of the ACM (JACM)
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
On the Structure of Armstrong Relations for Functional Dependencies
Journal of the ACM (JACM)
Query processing utilizing dependencies and horizontal decomposition
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Samples for Understanding Data-Semantics in Relations
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Horn clauses and database dependencies (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Supporting Semantic Diversity in the Relational Data Model: The Case of Multi-Face Attributes
Information Systems Frontiers
Semantic sampling of existing databases through informative Armstrong databases
Information Systems
Apriori algorithm and game-of-life for predictive analysis in materials science
International Journal of Knowledge-based and Intelligent Engineering Systems - Soft Computing and its Applications to E-Business
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
On Inferences of Full First-Order Hierarchical Decompositions
Fundamenta Informaticae - Logic, Language, Information and Computation
| Hi-index | 0.00 |
A general study is made of two basic integrity constraints on relations: functional and multivalued dependencies. The latter are studied via an equivalent concept: decompositions. A model is constructed for any possible combination of functional dependencies and decompositions. The model embodies some decompositions as unions of relations having different schemata of functional dependencies. This suggests a new, stronger integrity constraint, the degenerate decomposition. More generally, the theory demonstrates the importance of using the union operation in database design and of allowing different schemata on the operands of a union. Techniques based on the union lead to a method for solving the problem of membership of a decomposition in the closure of a given set of functional dependencies and decompositions. The concept of antiroot is introduced as a tool for describing families of decompositions, and its fundamental importance for database design is indicated.