Computing premises of a minimal cover of functional dependencies is intractable.
Mikhail A. BabinSergei O. KuznetsovPublished in: Discret. Appl. Math. (2013)
Keyphrases
- functional dependencies
- integrity constraints
- relational databases
- relational model
- normal form
- database design
- conflict free
- approximate functional dependencies
- database schemes
- inclusion dependencies
- user defined
- data dependencies
- logical implication
- entity relationship
- cardinality constraints
- relational schema
- xml documents
- computational complexity
- horn theories
- universal relation
- inference rules
- dynamic constraints
- database schema
- np complete
- relational database theory
- databases
- answering queries using views
- xml keys
- set of functional dependencies
- multivalued dependencies
- knowledge base