Decomposing an N-ary relation into a tree of binary relations
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Elements of relational database theory
Handbook of theoretical computer science (vol. B)
The design of relational databases
The design of relational databases
On the complexity of inferring functional dependencies
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
Fundamentals of database systems (2nd ed.)
Fundamentals of database systems (2nd ed.)
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Algorithms for inferring functional dependencies from relations
Data & Knowledge Engineering
On the Structure of Armstrong Relations for Functional Dependencies
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
A Feasibility and Performance Study of Dependency Inference
Proceedings of the Fifth International Conference on Data Engineering
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Mining Generalized Association Rules
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Tableaux for Functional Dependencies and Independencies
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Perspectives on database theory
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Design-By-Example: A Design Tool for Relational Databases
Design-By-Example: A Design Tool for Relational Databases
Theory of Relational Databases
Theory of Relational Databases
| Hi-index | 5.23 |
We prove normal form theorems of a complete axiom system for the inference of functional dependencies and independencies in relational databases. We also show that all proofs in our system have a normal form where the application of independency rules is limited to three levels. Our normal form results in a faster proof-search engine in deriving consequences of functional independencies. As a result, we get a new construction of an Armstrong relation for a given set of functional dependencies. It is also shown that an Armstrong relation for a set of functional dependencies and independencies do not exist in general, and this generalizes the same result valid under the closed-world assumption. Copyright 2001 Elsevier Science B.V.