ACM Home Page
Please provide us with feedback. Feedback
Testing implications of data dependencies
Full text PdfPdf (44 KB)
Source International Conference on Management of Data archive
Proceedings of the 1979 ACM SIGMOD international conference on Management of data table of contents
Boston, Massachusetts
SESSION: Database dependency theory table of contents
Pages: 152 - 152  
Year of Publication: 1979
ISBN:0-89791-001-X
Authors
David Maier  SUNY at Stony Brook, Stony Brook, New York
Alberto Mendelzon  Princeton University, Princeton, New Jersey
Yehoshua Sagiv  University of Illinois, Urbana, Urbana, Illinois
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 16,   Citation Count: 3
Additional Information:

abstract   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/582095.582119
What is a DOI?

ABSTRACT

We present a computation method---the chase---for testing implication of data dependencies by a set of data dependencies. The chase operates on tableaux similar to those of Aho, Sagiv, and Ullman. The chase includes previous tableau computation methods as special cases. By interpreting tableaux alternately as mappings or as templates for instances, we can test implication of functional and join dependencies. This information is useful in determining when a relational database scheme accurately represents the information it is intended to. The chase can also be used to test equivalence of database schemes and as part of the test of whether the relation schemes in a database scheme are independent components.


Collaborative Colleagues:
David Maier: colleagues
Alberto Mendelzon: colleagues
Yehoshua Sagiv: colleagues