The implication problem for data dependencies

Extended abstract
  • C. Beeri
  • M. Y. Vardi
Session 3: R. Sethi, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)


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.


  1. [ABU]
    Aho, A.V., Beeri, C., Ulman, J.D.: The theory of joins in relational databases. ACM TODS 4 (1979), pp. 297–314.Google Scholar
  2. [BB]
    Beeri, C., Bernstein, P.A.: Computational problems related to the design of normal form relational schemas. ACM TODS 4 (1979), pp. 30–59.Google Scholar
  3. [BBG]
    Beeri, C., Bernstein, P.A., Goodman, N.: A sophisticate's introduction to database normalization theory. Proc. 4th Conf. on VLDB, 1978, pp. 113–124.Google Scholar
  4. [Beer]
    Beeri, C.: On the membership problem for multivalued dependencies. ACM TODS 5 (1980), pp. 241–259.Google Scholar
  5. [Ber]
    Bernstein, P.A.: Synthesizing third normal form relation from functional dependencies. ACM TODS 1 (1976), pp. 277–298.Google Scholar
  6. [BeRi]
    Beeri, C., Rissanen, J.: Faithful representation of relational database schemes. IBM Research Report, San Jose, 1979.Google Scholar
  7. [BMSU]
    Beeri, C., Mendelzon, A.O., Sagiv, Y., Ullman, J.D.: Equivalence of relational database schemes. Proc. 11th ACM STOC, 1979, pp. 319–329.Google Scholar
  8. [Bo]
    Boone, W.W.: The word problem. Ann. of Math. 70 (1959), pp. 207–265.Google Scholar
  9. [BS]
    Bernays, P., Schonfinkel, M.: Zum Eintscheidungsproblem der Mathematischen Logik. Mat. Annal. 99 (1928), pp. 342–372.Google Scholar
  10. [BV1]
    Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. Proc. XP1 Workshop, 1980. Also, Research Report, The Hebrew University of Jerusalem, 1980.Google Scholar
  11. [BV2]
    Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. Research Report, The Hebrew University of Jerusalem, 1980.Google Scholar
  12. [BV3]
    Beeri, C., Vardi, M.Y.: On the complexity of testing implication of data dependencies. Research Report. The Hebrew University of Jerusalem, 1980.Google Scholar
  13. [BV4]
    Beeri, C., Vardi, M.Y.: Axiomatization of tuple and equality generating dependencies. Research Report, The Hebrew University of Jerusalem, 1981.Google Scholar
  14. [CLM]
    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.Google Scholar
  15. [Codd]
    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.Google Scholar
  16. [Fagl]
    Fagin, R.: Multivalued dependencies and a new normal form for relational databases. ACM TODS 2 (1977), pp. 262–278.Google Scholar
  17. [Fag2]
    Fagin, R.: Horn clauses and database dependencies. Proc. 12th ACM STOC, 1980, pp. 123–134.Google Scholar
  18. [JP]
    Janssens, D., Paredaens, J.: General dependencies. Workshop on Formal Bases for Databases, Toulouse, Dec. 1979.Google Scholar
  19. [Ka]
    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.Google Scholar
  20. [McKe]
    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.Google Scholar
  21. [MMS]
    Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing Implications of data dependencies. ACM TODS 4 (1979), pp. 455–469.Google Scholar
  22. [MSY]
    Maier, D., Sagiv, Y., Yannakakis, M.: On the complexity of testing implications of functional and join dependencies. to appear in JACM.Google Scholar
  23. [Nico]
    Nicolas, J.M.: First order logic formalization for functional, multivalued and mutual dependencies. Proc. ACM-SIGMOD, 1978, pp. 40–46.Google Scholar
  24. [Ra]
    Rabin, M.O.: Recursive unsolvability of group-theoretic problems. Ann. of Math. 67 (1958), pp. 172–194.Google Scholar
  25. [Riss]
    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.Google Scholar
  26. [SU]
    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.Google Scholar
  27. [TMR]
    Tarski, A., Mostowski, A., Robinson, R.M.: Undecidable theories. North-Holland, Amsterdam, 1953.Google Scholar
  28. [Va]
    Vardi, M.Y. Inferring multivalued dependencies from functional and join dependencies. Research Report, The Weizmann Institute of Science, 1980.Google Scholar
  29. [YP]
    Yannakakis, M., Papadimitriou, C.: Algebraic dependencies. Proc. 21st IEEE Symp. on FOCS, 1980, pp. 328–332.Google Scholar
  30. [Zan]
    Zaniolo, C.: Analysis and design of relational schemata for database systems. Technical Report UCLA-ENG-7769, UCLA, 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • C. Beeri
    • 1
  • M. Y. Vardi
    • 1
  1. 1.Department of Computer ScienceThe Hebrew University of JerusalemJerusalemIsrael

Personalised recommendations