ACM Home Page
Please provide us with feedback. Feedback
Testing implications of data dependencies
Full text PdfPdf (1.14 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 4 ,  Issue 4  (December 1979) table of contents
Pages: 455 - 469  
Year of Publication: 1979
ISSN:0362-5915
Authors
David Maier  State Univ. of New York at Stony Brook, Stony Brook
Alberto O. Mendelzon  Princeton Univ., Princeton, NJ
Yehoshua Sagiv  Univ. of Illinois, Urbana
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 75,   Citation Count: 121
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/320107.320115
What is a DOI?

ABSTRACT

Presented is 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 relations, it is possible to test implication of join dependencies (including multivalued dependencies) and functional dependencies by a set of dependencies.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
AHO, A.V., BEERI, C., AND ULLMAN, J.D. The theory of joins in relational databases. Proc. 18th Syrup. on Foundations of Computer Science, Providence, R.I., 1977, pp. 107-113.
 
2
AHO, A,V,, SAGIV, Y., AND ULLMA~, J.D. Equivalence of relational expressions. SIAM J. Comping. 8, 2 (May 1979), 218-246.
 
3
ARMSTRONG, W.W. Dependency structures of data base relationships. Proc. IFIP '74, North- Holland Pub. Co., Amsterdam, 1974, pp. 580-583.
 
4
BEERI, C. On the membership problem for multivalued dependencies in relational databases. Tech. Rep. 229, Dept. Elec. Eng. and Comptr. Sci., Princeton U., Princeton, N.J., 1977.
 
5
BEERI, C. On the role of data dependencies in the construction of relational database schemas. Tech. Rep. 43, Dept. Comptr. Sci., The Hebrew University, Jerusalem, Israel, 1979.
 
6
BEERI, C., BERNSTEIN, P., AND GOODMAN, N. A sophisticate's introduction to database normalization theory. Proc. 4th Int. Conf. on Very Large Data Bases, West Berlin, 1978, pp. 113-124.
7
8
9
10
11
 
12
DELOBEL, C. Contributions theoretiques a-la conception et a l'evaluation d'un systeme d'informations applique a la gestion. These d'Etat, U. of Grenoble, Grenoble, France, 1973.
13
14
 
15
HAGIHARA, K., Iwo, M., TANIGUCHI, K., AND KASAMI, T. Decision problems for multivalued dependencies in relational databases. SIAM J. Comptng. 8, 2 (May 1979), 247-264.
 
16
MAIER, D., MENDELZON, A.O., SADRI, F., AND ULLMAN, J.D. Adequacy of decompositions of relational databases. Unpub. manuscript.
17
 
18
RISSANEN, J. Theory of relations for databases--a tutorial survey. Proc. 7th Syrup. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 64, Springer- Verlag, 1978, pp. 536-551.
 
19
SAGIV, Y. An algorithm for inferring multivalued dependencies that works also for a subclass of propositional logic. Rep. UIUCDCS-R-79-954, Dept. Comptr. Sci., U. of Illinois, Urbana-Champaign, Ill., 1979.
 
20

CITED BY  121
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

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

Peer to Peer - Readers of this Article have also read: