Testing of join dependency preserving by a modified chase method

Communications

First Online: 03 June 2005

Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)

This is a preview of subscription content, to check access.

Preview

Unable to display preview. Download preview PDF.

1.
Codd, E.F., ‘Further Normalization of the Data Base Relational Model', Proc. Courant Computer Science Symposium 6, Data Base Systems, pp.33–64, May 1971.Google Scholar
2.
Fagin, R., ‘Multivalued Dependencies and a New Normal Form for Relational Databases', ACMTODS, vol.2, no.3, pp.262–278, September 1977.Google Scholar
3.
Rissanen, J., ‘Theory of Relations for Databases — A Tutorial Survey', Lecture Notes in Computer Science 64, pp.536–551, September 1978.Google Scholar
4.
Maier, D., Mendelzon, A.O. and Sagiv, Y., ‘Testing Implications of Data Dependencies', ACMTODS, vol.4, no.4, pp.455–469, December 1979.Google Scholar
5.
Sciore,E., ‘A Complete Axiomatization of Full Join Dependencies', Dept. of EECS, Princeton University, Technical Report, TR-279, July 1979.Google Scholar
6.
Beeri,C. and Rissanen,J., ‘Faithful Representations of Relational Database Schemes', IBM Res. Rep., RJ2722, January 1980.Google Scholar
7.
Fagin,R., Mendelzon,A.O. and Ullman,J.D., ‘A Simplified Universal Relation Assumption and Its Properties', IBM Res. Rep., RJ2900, November 1980.Google Scholar
8.
Kambayashi,Y., Tanaka,K. and Yajima,S., ‘Problems of Relational Database Design', to appear in Lecture Notes in Computer Science, ‘Database Engineering', Springer-Verlag, 1981.Google Scholar