The equivalence problem for relational database schemes

  • Joachim Biskup
  • Uwe Räsch
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 305)


Mappings between the sets of instances of database schemes are used to define different degrees of equivalence. The available class of mappings and the set of dependencies allowed for defining schemes deal here as parameters. A comparison of the equivalences shows that there is only one natural kind of equivalence. For various cases we prove its decidability or undecidability. Besides we get a characterization of mappings expressible in the relational algebra without the difference.


Relation Scheme Relational Algebra Database Scheme Finite Model Existential Quantifier 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ABM]
    G. Ausiello, C. Batini, M. Moscarini: ‘Conceptual relations between databases transformed under join and projection's in: Proc. Symp. Math. Found. of Comp. Sc., 9, 1980, pp. 123–136Google Scholar
  2. [AABM]
    P. Atzeni, G. Aussiello, C. Batini, M. Moscarini: ‘Inclusion and equivalence between relational database schemes', in: Theoretical Computer Science, 19, 1982, pp. 267–285Google Scholar
  3. [AP]
    P. Atzeni, D.S. Parker: ‘Assumptions in relational database theory', in: ACM Symp. on Princ. of Database Systems, 1, 1982, pp. 1–9Google Scholar
  4. [ASU]
    A.V. Aho, Y. Sagiv, J.D. Ullman: ‘Equivalences among relational expressions', in: SIAM Journ. of Computing, 8, 1979, pp. 218–246Google Scholar
  5. [AU]
    A.V. Aho, J.D. Ullman: ‘Universality of data retrieval languages', in: ACM Symp. on Princ. of Programming Languages, 6, 1979, pp. 110–117Google Scholar
  6. [AV]
    S.Abiteboul, V.Vianu: ‘Transactions in relational databases', in: Proc. ACM Int. Conf. on Very Large Data Bases, 1984Google Scholar
  7. [Banc]
    F. Bancilhon: ‘On the completeness of query languages for relational data bases', in: Proc. Symp. Math. Found. of Computer Science, 7, 1978, pp. 112–123Google Scholar
  8. [BBG]
    P.A. Bernstein, C. Beeri, N. Goodman: ‘A sophisticated introduction to database normalization theory', in: Proc. ACM Int. Conf. on Very Large Data Bases, 4, 1978, pp. 113–124Google Scholar
  9. [Biller]
    H. Biller: ‘On the equivalence of database schemes — a semantic approach to data translation', in: Information Systems, 4, 1979, pp. 35–47Google Scholar
  10. [BMSU]
    C. Beeri, A.O. Mendelzon, Y. Sagiv, J.D. Ullman: ‘Equivalence of relational database schemes', in: SIAM Journ. of Computing, 10, 1981, pp. 352–370Google Scholar
  11. [CFP]
    M. Casanova, R. Fagin, C.H. Papadimitiou: ‘Inclusion dependencies and their interaction with functional dependencies', in: ACM Symp. on Princ. of Database Systems, 1, 1982, pp. 171–176Google Scholar
  12. [CH]
    A.K. Chandra, D. Harel: ‘Computable queries for relational data bases', in: Journ. of Computer and System Sciences, 21, 1980, pp. 156–178Google Scholar
  13. [CLM]
    A.K. Chandra, H.R. Lewis, J.A. Makowsky: ‘Embedded implicational dependencies and their inference problem', in: ACM Symp. on Theory of Computing, 13, 1981, pp. 342–354Google Scholar
  14. [Codd]
    E.F. Codd: ‘Further normalizations on data base relational model', in: Data Base Systems (R. Rustin ed.), Prentice-Hall, Englewood Cliffs, 1972, pp. 33–64Google Scholar
  15. [CV]
    M.A. Casanova, V.M.P. Vidal: ‘Towards a sound view integration methodology', in: ACM Symp. on Princ. of Database Systems, 2, 1983, pp. 36–47Google Scholar
  16. [DG]
    B. Dreben, W.D. Goldfarb: ‘The decision problem: solvable classes of quantificational formulas', Addison-Wesley Publishing Company, Reading, 1979Google Scholar
  17. [FV]
    R.Fagin, M.Y.Vardi: ‘The theory of data dependencies — a survey', IBM Research Report 4321, San Jose, 1984Google Scholar
  18. [Gee]
    W.C. Mc Gee: ‘A contribution to the study of data equivalence', in: Database Management (J.W. Klimbie etc. ed.), Cargese, Amsterdam, 1974, pp. 123–148Google Scholar
  19. [GJ]
    J. Grant, B.E. Jacobs: ‘On the family of generalized dependency constraints', in: Journ. of the ACM, 29, 1982, pp. 986–997Google Scholar
  20. [GM]
    J. Graham, A.O. Mendelzon: ‘Strong equivalence of relational expressions under dependencies', in: Information Processing Letters, 14, 1982, pp. 57–62Google Scholar
  21. [GMN]
    H. Gallaire, J. Minker, J.M. Nicolas: ‘Logic and databases: a deductive approach', in: ACM Computing Surveys, 16, 1984, pp. 153–185Google Scholar
  22. [GV]
    M.H. Graham, M.Y. Vardi: ‘On the complexity and axiomatizability of consistent database states', in: Proc. ACM Symp. on Princ. of Database Systems, 3, 1984, pp. 281–289Google Scholar
  23. [Hull]
    R. Hull: ‘Relative information capacity of simple relational database schemata', Techn. Rep. 84-300, Comp. Science Department, Univ. South. Calif., Los Angeles, 1984Google Scholar
  24. [Hull]
    R. Hull: ‘Relative information capacity of simple relational database schemata', in: Proc. ACM Symp. on Princ. of Database Systems, 3, 1984, pp. 97–109Google Scholar
  25. [IL1]
    T.Imielinski, W.Lipski: ‘A technique for translating states between database schemata', in: ACM Int. Conf. on Management of data, 1982, pp. 61–68Google Scholar
  26. [IL2]
    T. Imielinski, W. Lipski: ‘On the undecidability of equivalence problems for relational expressions', in: Advances in Data Base Theory, 2, 1985, pp. 393–409Google Scholar
  27. [IS]
    T. Imielinski, N. Spyratos: ‘On lossless transformation of database states not necessarily satisfying universal instance assumption', in: Proc. ACM Symp. on Princ. of Database Systems, 3, 1984, pp. 258–265Google Scholar
  28. [Koba]
    I. Kobayashi: ‘Losslessness and semantic correctness of database scheme transformation: another look of schema equivalence', in: Information Systems, 11, 1986, pp. 41–59Google Scholar
  29. [KK]
    P.Kandzia, H.J.Klein: ‘On the equivalence of relational data bases in connection with normalization', Techn. Rep. 7901, Univ. Kiel, 1979Google Scholar
  30. [JAK]
    B.E. Jacobs, A.R. Aronson, A.C. Klug: ‘On interpretations of relational languages and solutions to the implied constraint problem', in: ACM Transactions on Database Systems, 7, 1982, pp. 291–315Google Scholar
  31. [KCV]
    P.C. Kanellakis, S.S. Cosmodakis, M.Y. Vardi: ‘Unary inclusion dependencies have polynomial time inference problem', in: Proc. ACM Symp. Theory of Computing, 15, 1983, pp. 264–277Google Scholar
  32. [Klug]
    A. Klug: ‘Calculating constraints on relational expressions', in: ACM Transactions on Database Systems, 5, 1980, pp. 260–290Google Scholar
  33. [Mitch]
    J.C. Mitchell: ‘The implication problem for functional and inclusion dependencies', in: Information and Control, 56, 1983, pp. 154–173Google Scholar
  34. [Reiter]
    R. Reiter: ‘Equality and domain closure on first — order databases', in: Journ. of the ACM, 27, 1980, pp. 235–249Google Scholar
  35. [Riss]
    J. Rissanen: ‘On the equivalence of database schemes', in: Proc. ACM Symp. Princ. of Database Systems, 1, 1982, pp. 23–26Google Scholar
  36. [Solo]
    M.K.Solomon: ‘Undecidability of the equivalence problem for relational expressions', in: Bell Lab. MemoGoogle Scholar
  37. [Sier]
    W. Sierpinski: ‘Cardinal and ordinal numbers', PWN Polish Scientific Publishers, Warschau, 1965Google Scholar
  38. [SY]
    Y. Sagiv, M. Yannakakis: ‘Equivalence among relational expressions', in: Proc. ACM Int. Conf. on Very Large Data Bases, 4, 1978; pp. 535–548Google Scholar
  39. [Ullm]
    J.D. Ullman: ‘Principle of Database Systems', Computer Science Press, Rockville, 1982Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Joachim Biskup
    • 1
  • Uwe Räsch
    • 1
  1. 1.Institut für Informatik Hochschule HildesheimHildesheimFederal Republic of Germany

Personalised recommendations