Abstract
In this paper we study the implication and the finite implication problems for data dependencies. When all dependencies are total the problems are equivalent and solvable but are NP-hard, i.e., probably computationally intractable. For non-total dependencies the implication problem is unsolvable, and the finite implication problem is not even partially solvable. Thus, there can be no formal system for finite implication. The meta decision problems of deciding for a given class of dependencies whether the implication problem is solvable or whether implication is equivalent to finite implication are also unsolvable.
Research partially supported by Grant 1849/79 of the U.S.A.-Israel Binational Science Foundation.
Chapter PDF
Similar content being viewed by others
References
Aho, A.V., Beeri, C., Ulman, J.D.: The theory of joins in relational databases. ACM TODS 4 (1979), pp. 297–314.
Beeri, C., Bernstein, P.A.: Computational problems related to the design of normal form relational schemas. ACM TODS 4 (1979), pp. 30–59.
Beeri, C., Bernstein, P.A., Goodman, N.: A sophisticate's introduction to database normalization theory. Proc. 4th Conf. on VLDB, 1978, pp. 113–124.
Beeri, C.: On the membership problem for multivalued dependencies. ACM TODS 5 (1980), pp. 241–259.
Bernstein, P.A.: Synthesizing third normal form relation from functional dependencies. ACM TODS 1 (1976), pp. 277–298.
Beeri, C., Rissanen, J.: Faithful representation of relational database schemes. IBM Research Report, San Jose, 1979.
Beeri, C., Mendelzon, A.O., Sagiv, Y., Ullman, J.D.: Equivalence of relational database schemes. Proc. 11th ACM STOC, 1979, pp. 319–329.
Boone, W.W.: The word problem. Ann. of Math. 70 (1959), pp. 207–265.
Bernays, P., Schonfinkel, M.: Zum Eintscheidungsproblem der Mathematischen Logik. Mat. Annal. 99 (1928), pp. 342–372.
Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. Proc. XP1 Workshop, 1980. Also, Research Report, The Hebrew University of Jerusalem, 1980.
Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. Research Report, The Hebrew University of Jerusalem, 1980.
Beeri, C., Vardi, M.Y.: On the complexity of testing implication of data dependencies. Research Report. The Hebrew University of Jerusalem, 1980.
Beeri, C., Vardi, M.Y.: Axiomatization of tuple and equality generating dependencies. Research Report, The Hebrew University of Jerusalem, 1981.
Chandra, A.K., Lewis, H.R., Makowsky, J.A.: Embedded implicational dependencies and their inference problem. Proc. XP1 Workshop, 1980. Revised, Proc. 13th ACM STOC, 1981.
Codd, E.F.: Further normalization of the data base relational model. in Data Base Systems (R. Rustin, ed.), Prentice-Hall, N.J., 1972, pp. 33–64.
Fagin, R.: Multivalued dependencies and a new normal form for relational databases. ACM TODS 2 (1977), pp. 262–278.
Fagin, R.: Horn clauses and database dependencies. Proc. 12th ACM STOC, 1980, pp. 123–134.
Janssens, D., Paredaens, J.: General dependencies. Workshop on Formal Bases for Databases, Toulouse, Dec. 1979.
Karp, R.M.: Reducibility among combinatorial problems. in Complexity of Computer Computation (R.E. Miller and J.W. Thatcher, eds.) Plenum Press, 1972, pp. 85–103.
McKenzie, R.: On spectra, and the negative solution for identities having a finite non-trivial model. J. of Symbolic Logic 40 (1975), pp. 186–196.
Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing Implications of data dependencies. ACM TODS 4 (1979), pp. 455–469.
Maier, D., Sagiv, Y., Yannakakis, M.: On the complexity of testing implications of functional and join dependencies. to appear in JACM.
Nicolas, J.M.: First order logic formalization for functional, multivalued and mutual dependencies. Proc. ACM-SIGMOD, 1978, pp. 40–46.
Rabin, M.O.: Recursive unsolvability of group-theoretic problems. Ann. of Math. 67 (1958), pp. 172–194.
Rissanen, J.: Theory of relations for databases — a tutorial survey. Proc. 7th Symp. on MFCS, Poland, 1978, Lecture Notes in Computer Science 64, Springer-Verlag, pp. 537–551.
Sadri, P., Ullman, J.D.: A complete axiomatization for a large class of dependencies in relational databases. Proc. 12th ACM STOC, 1980, pp. 117–122.
Tarski, A., Mostowski, A., Robinson, R.M.: Undecidable theories. North-Holland, Amsterdam, 1953.
Vardi, M.Y. Inferring multivalued dependencies from functional and join dependencies. Research Report, The Weizmann Institute of Science, 1980.
Yannakakis, M., Papadimitriou, C.: Algebraic dependencies. Proc. 21st IEEE Symp. on FOCS, 1980, pp. 328–332.
Zaniolo, C.: Analysis and design of relational schemata for database systems. Technical Report UCLA-ENG-7769, UCLA, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beeri, C., Vardi, M.Y. (1981). The implication problem for data dependencies. In: Even, S., Kariv, O. (eds) Automata, Languages and Programming. ICALP 1981. Lecture Notes in Computer Science, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10843-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-10843-2_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10843-6
Online ISBN: 978-3-540-38745-9
eBook Packages: Springer Book Archive