ACM Home Page
Please provide us with feedback. Feedback
A Proof Procedure for Data Dependencies
Full text PdfPdf (1.33 MB)
Source Journal of the ACM (JACM) archive
Volume 31 ,  Issue 4  (October 1984) table of contents
Pages: 718 - 741  
Year of Publication: 1984
ISSN:0004-5411
Authors
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 110,   Citation Count: 53
Additional Information:

references   cited by   index terms   review   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/1634.1636
What is a DOI?

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
ABITEBOUL, S., AND VARDI, M. Y.Formal systems for untyped data dependencacs, To appear.
2
 
3
Av~o, A. V., SAGIV, Y., AND ULLMAN, J. D.Euivalence among relational expressions. SIAM d Comput. 8 ( 1979), 218-246.
 
4
ARMSTRONG, W. W.Dependency structure in data base relationships. In Proceedings of lFIP 74, Elsevier North-Holland, New York, 1974, pp. 580-583.
5
6
7
 
8
BEERI, C., BERNSTEIN, P. A., AND GOODMAN, N. A sophisticate's introduction to database normalization theory. In Proceedings of the 4th lnternattonaI Conference on Very Large Data Bases (West Berlin, Germany, Sept. 13-15). ACM, New York, 1978, pp. 113-124.
9
 
10
BERRI, C., MENDELZON, A. O., SAGIV, Y., AND ULLMAN, J. D. Eqmvalence of relational database schemes. SIAM Y Comput 10 (1981), 647-656.
 
11
BI~ERI, C., AND RISSANEN, J.Fmthful representation of relational database schemes. IBM Res. Rep. IBM, San Jose, 1980.
 
12
BEERI, C., AND VARDI, M. Y.On the complexity of testing implication of data dependencies. Res. Pep. Dept. Computer Science, The Hebrew University of jerusalem, Jerusalem, Israel, 1980.
 
13
 
14
BEERI, C., AND VARDI, M. Y. On the properties of join dependencies. In Advances in Database Theory, H. GaUatre, J. Mmker, and J. M. Nicolas, Eds. Plenum Press, New York, 1981, pp. 25-72.
 
15
BEERI, C., AND VARDI, M. Y.Formal system for tuple and equality generating dependencies. SIAM J Comput 13 (1984), 76--98.
16
 
17
BISKUP, J.On the complementation rule for multivalued dependencies in data base relations. Acta lnf 10 (1978), 297-305.
 
18
BISKUP, J Inferences of multivalued dependenctes in fixed and undetermined universe. Theor Comput Set 10 (1980), 93-105.
19
 
20
 
21
CODD, E. F.Further normalization of the data base relatlonal model. In Data Base Systems (R. Rustin, Ed.). Prentice-Hall, Englewood Cliffs, N.J., 1972, pp. 33-64.
22
23
24
25
 
26
FAGIN, R., MAmR,.D., ULLMAN, J. D., AND YANNAKAKIS, M.Tools for template dependencies. SlAM J. Comput. 12 (1983), 36-59,
 
27
GRAHAM, M. H.A new proof that the chase is a Chureh-Rosser replacement system. In Proceedings of the XPI Workshop on Relational Database Theory (Stony Brook, June) 1980.
28
29
 
30
ITO, M., TAN|GUCHI, K., AND KASAMI, T.Membership problem for embedded multivalued dependencies under some restr~ed conditions. Theor. Comput. Sci. 23 (1983), 175--194.
 
31
KANI/LLAKIS, P.C. On the computational complexity of cardinality constraints in relational databases. Inf. Proc. Left. 1I (1980), 98-101.
 
32
M~mR, D., MENDELZON, A. O., SADRI, F., AND ULLMAN, J. D.Adequacy of decompositions of relational databases. In Advances in Database Theory, H. Gallaire, J. Minker, and J. M. Nicolas, Eds. Plenum Press, New York, 1981, pp. 101-114.
33
34
35
36
 
37
NICOLAS, J. M.Mutual dependencies and some results on undeeomposable relations. In Proceedings of the 4th International Conference on Very Large Data Bases (West Berlin, Germany, Sept. 13-15). ACM, New York, 1978, pp. 360--367.
 
38
PAREDAEN$, J.Transitive dependencies in a database scheme. RAIRO lnf./Comput Sci 14 (1980), 149-164.
 
39
PAREDAI/NS, J.The interaction of integrity constraints in an information system. J. Comput Syst. Sci. 20 (1980), 310-329,
 
40
PAREDAENS, J.A universal formalism to express decomposition, functional dependencies and other constraints in a relational database. Theor. Comput. Sci. 19 (1982), 143-160.
 
41
PAREDAENS, J., AND JANSSENS, D.Decompositions of relations--A comprehensive approach. In Advances in Database Theory, H. Gallaire, J. Minker, and J. M. Nicolas, Eds. Plenum Press, New York, 1981, pp. 73-I00.
 
42
RISSANEN, J.Theory of relations for databases--A tutorial survey. In Proceedings of the 7th Symposium on Mathematwal Foundattons of Computer Science (Zakopane, Poland, Sept. 4-8) Lecture Notes in Computer Science, vol. 64. Springer-Vedag, New York, 1978, pp, 537-551.
43
 
44
SADRI, F., AND ULLMAN, J.D.The theory of functional and template dependencies. Theor Comput. Sci. 17 (1982), 317-332.
45
46
47
 
48
VARDi, M. Y.Axiomatization of functional and join dependencies in the relational model. M.Se. Thesis, Dept. Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel, 1980.
 
49
VARDI, M.Y. The implication problem for data dependencies in relational databases. Ph.D. Thesis (in Hebrew), The Hebrew University of Jerusalem, Jerusalem, Israel, 1981.
 
50
V ARt)I, M. Y. The implication and the finite implication problems for typed template dependenties. Jr. Comput System Sci. 28, 1 (Feb. 1984), 3-28.
 
51
VARD{, M.Y. On the decomposition of relational databases. In Proceedings of the 23rd, lEEE Symposium on the Foundations of Computer Science, (Chicago, Nov. 3-5). IEEE, New York, 1982, pp. 176-187.
 
52
VA~m, M. Y.Inferring multivalued delx~dencies from functional and join dependencies, Acta Inf. 19 (1983), 305-324.
 
53
VARO~, M. Y.Inferring multivalued dependencies from tuple and equality generating dependencies, To appear.
 
54
YANNAKAKiS, M., AND PAPDIMITRIOU, C. Algebraic dependencies. J. Comput. System ScL 21 (1982), 2-41.
 
55
ZANIOLO, C.Analysis and design of relational schemata for database systems. Tech, Pep. UCLA- ENG-7769, Dept. Computer Science, UCLA, Los Angeles, July 1976.

CITED BY  53


REVIEW

"Seymour Ginsburg : Reviewer"

During the past decade a host of different dependencies have been introduced into the relational model to capture different semantics. For unification and other purposes, some rather general types of dependencies have been abstracted, such as t  more...

Collaborative Colleagues:
Catriel Beeri: colleagues
Moshe Y. Vardi: colleagues