Normalization of relations and PROLOG
Communications of the ACM
Database system concepts
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
Independent components of relations
ACM Transactions on Database Systems (TODS)
Decompositions and functional dependencies in relations
ACM Transactions on Database Systems (TODS)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reflections on Boyce-Codd Normal Form
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Theory of functional relation schemes in relational databases
Theory of functional relation schemes in relational databases
Theory of Relational Databases
Theory of Relational Databases
Practical algorithms for finding prime attributes and testing normal forms
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constant-time maintainability: a generalization of independence
ACM Transactions on Database Systems (TODS)
On the decidability and axiomatization of query finiteness in deductive databases
Journal of the ACM (JACM)
FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Extending and inferring functional dependencies in schema transformation
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Functional and multivalued dependencies in nested databases generated by record and list constructor
Annals of Mathematics and Artificial Intelligence
An ontology based approach to the integration of entity-relationship schemas
Data & Knowledge Engineering - Special issue: ER 2004
Propagating XML constraints to relations
Journal of Computer and System Sciences
Propagating functional dependencies with conditions
Proceedings of the VLDB Endowment
Finding faithful boyce-codd normal form decompositions
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
This paper deals with the problem of computing covers for the functional dependencies embedded in a subset of a given relation schema. We show how this problem can be simplified and present a new and efficient algorithm “Reduction. By Resolution” (RBR) for its solution. Though the problem of computing covers for embedded dependencies is inherently exponential, our algorithm behaves polynomially for several classes of inputs. RBR can be used for the solution of some related problems in the theory of database design, such as deciding whether a given database scheme is in Boyce-Codd Normal Form or decomposing a scheme into Boyce-Codd Normal Form.