The Implication Problem for Functional and Inclusion Dependencies
Name
MIT-LCS-TM-235.pdf
Size
5.73 MB
Format
Adobe PDF
Checksum (MD5)
7860aaf55cbc5b3764dd43b83a27b559
Author(s)
Mitchell, John C.
Date Issued
February 1983
Series/Report no.
MIT-LCS-TM-235
Abstract
There are two implication problems for functional dependencies and inclusion dependencies: general implication and finite implication. Given a set of dependencies ∑∪{σ}, the problems are to determine whether σ holds in all databases satisfying ∑ or all finite databases satisfying ∑. Contrary to the possibility suggested in [5], there is a natural, complete axiom system for general implication. However, a simple observation shows that both implication problems are recursively unsolvable. It follows that there is no recursively enumerable set of axioms for finite implication.
Persistent DSpace Link
