A Proof Procedure for Data Dependencies

@article{Beeri1984APP,
  title={A Proof Procedure for Data Dependencies},
  author={Catriel Beeri and Moshe Y. Vardi},
  journal={J. ACM},
  year={1984},
  volume={31},
  pages={718-741}
}
A class of dependencies, tuple and equality generating dependencies, is defined, and the chase process is generalized to deal with these dependenetes. For total dependencies the chase is an exponential ttme decision procedure for the implication problem, and in some restricted cases it can be modified to run m polynomial Ume. For nontotal dependencies the chase is only a proof procedure. However, several cases for which it is a decision procedure are shown. It is also shown that equality is… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 401 citations. REVIEW CITATIONS

Topics

Statistics

02040'82'85'89'93'97'01'05'09'13'17
Citations per Year

402 Citations

Semantic Scholar estimates that this publication has 402 citations based on the available data.

See our FAQ for additional information.