A note on lossless database decompositions
Information Processing Letters - Lecture Notes in Computer Science, no. 173
Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Functional dependencies and constraints on Null values in database relations
Information and Control
Acta Cybernetica
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Acta Cybernetica
Efficient optimization of simple chase join expressions
ACM Transactions on Database Systems (TODS)
Conjectures and refutations in database design and dependency theory
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Simple conditions for guaranteeing higher normal forms in relational databases
ACM Transactions on Database Systems (TODS)
The design of relational databases
The design of relational databases
Relational database theory
Design of desirable relational database schemes
Journal of Computer and System Sciences
An integrated approach to logical design of relational database schemes
ACM Transactions on Database Systems (TODS)
Axiomatisation of functional dependencies in incomplete relations
Theoretical Computer Science
An introduction to database systems (7th ed.)
An introduction to database systems (7th ed.)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Independent components of relations
ACM Transactions on Database Systems (TODS)
Minimum Covers in Relational Database Model
Journal of the ACM (JACM)
On the Equivalence of Database Models
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
An improved algorithm for finding a key of a relation
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
A Guided Tour of Relational Databases and Beyond
A Guided Tour of Relational Databases and Beyond
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Improving database schemes by adding attributes
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
The additivity Problem for Data Dependencies in Incomplete Relational Databases
Selected Papers from a Workshop on Semantics in Databases
Decomposition of a relation scheme into Boyce-Codd Normal Form
ACM SIGACT News
Theory of Relational Databases
Theory of Relational Databases
FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Functional and multivalued dependencies in nested databases generated by record and list constructor
Annals of Mathematics and Artificial Intelligence
Constraint acquisition for Entity-Relationship models
Data & Knowledge Engineering
Mining correct properties in incomplete databases
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
When data dependencies over SQL tables meet the logics of paradox and S-3
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Exploiting conflict structures in inconsistent databases
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
On the role of the complementation rule for data dependencies over incomplete relations
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Data cleaning and query answering with matching dependencies and matching functions
Proceedings of the 14th International Conference on Database Theory
Design by example for SQL table definitions with functional dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
On the existence of armstrong data trees for XML functional dependencies
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
ACM Transactions on Database Systems (TODS)
Reasoning about functional and full hierarchical dependencies over partial relations
Information Sciences: an International Journal
Hi-index | 0.00 |
Although there has been a vast amount of research in the area ofrelational database design, to our knowledge, there has been very little work that considers whether this theory is still valid when relations in the database may be incomplete. When relations are incomplete and thus contain null values the problem of whether satisfaction is additive arises. Additivity is the property of the equivalence of the satisfaction of a set of functional dependencies (FDs) F with the individual satisfaction of each member of F in an incomplete relation. It is well known that in general, satisfaction of FDs is not additive. Previously we have shown that satisfaction is additive if and only if the set of FDs is monodependent. We conclude that monodependence is a fundamental desirable property of a set of FDs when considering incomplete information in relational database design. We show that, when the set of FDs F either satifies the intersection property or the split-freeness property, then the problem of finding an optimum cover of F can be solved in polynomial time in the size of F; in general, this problem is known to be NP-complete. We also show that when F satisfies the split-freeness property then deciding whether there is a superkey of cardinality k or less can be solved in polynomial time in the size of F, since all the keys have the same cardinality. If F only satisfies the intersection property then this problem is NP-complete, as in the general case. Moreover, we show that when F either satisfies the intersection property or the split-freeness property then deciding whether an attribute is prime can be solved in polynomial time in the size of F; in general, this problem is known to be NP-complete. Assume that a relation schema R is an appropriate normal form with respect to a set of FDs F. We show that when F satisfies the intersection property then the notions of second normal form and third normal form are equivalent. We also show that when R is in Boyce-Codd Normal Form (BCNF), then F is monodependent if and only if either there is a unique key for R, or for all keys X for R, the cardinality of X is one less than the number of attributes associated with R. Finally, we tackle a long-standing problem in relational database theory by showing that when a set of FDs F over R satisfies the intersection property, it also satisfies the split-freeness property (i.e., is monodependent), if and only if every lossless join decomposition of R with respect to F is also dependecy preserving. As a corollary of this result we are able to show that when F satisfies the intersection property, it also satisfies the intersection property, it also satisfies the split-freeness property(i.e., is monodependent), if and only if every lossless join decomposition of R, which is in BCNF, is also dependency preserving. Our final result is that when F is monodependent, then there exists a unique optimum lossless join decomposition of R, which is in BCNF, and is also dependency preserving. Furthermore, this ultimate decomposition can be attained in polynomial time in the size of F.