Skip to main content
SpringerLink
Log in
Book cover

Advances in Databases and Information Systems pp 391–404Cite as

Relational Databases Equivalence Problem

  • Conference paper

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

Two relational databases are considered as equivalent, if a reply to an arbitrary query to the first database can be obtained by the means of the second one, and vice versa. The problem is to formalize this idea and to develop an algorithm of verification of relational databases equivalence. In the paper this problem is solved for relational databases with finite data algebras.

This research has been partially supported by the Israeli Ministry of Science and Technology Grant 4210.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beeri C., Mendelzon A., Sagiv Y., Ullman J. Equivalence of relational database schemes ACM (1979) 319–329

    Google Scholar 

  2. Beniaminov E. Algebraic invariants of relational databases Data Banks (1980) 47–52

    Google Scholar 

  3. Borkin S. Data models: a semantic approach for database systems The MIT Press Series in computer science (1980)

    Google Scholar 

  4. Borkin S. Data model equivalence Proc. Int. Conf. on very large data bases, IEEE (1978)

    Google Scholar 

  5. Fleck M. On the equivalence of data base models Technical report TR 25.144, IBM laboratory Vienna (1975)

    Google Scholar 

  6. Henkin L., Monk I., Tarski A. Cylindric algebras Amsterdam, London (1971)

    Google Scholar 

  7. Kay M. An assessment of the Codasyl DDL for use with a relational subschema Data Base Description, North-Holland Publishing (1975)

    Google Scholar 

  8. Neuhold E. Data mappings: a formal hierarchical and relational view Universitat Karlsruhe, Institut Fur Angewandte Informatik (1973)

    Google Scholar 

  9. Plotkin B. Universal algebra, algebraic logic and databases. Kluwer (1993)

    Google Scholar 

  10. Plotkin T. Equivalent transformations of relational databases. Latvian Math. Annual 29 (1985) 137–150

    MathSciNet  Google Scholar 

  11. Plotkin T. Algebraic logic in the problem of databases equivalency Logic Colloquium’94 (1994) 104

    Google Scholar 

  12. Tsalenko M. Modeling of semantics in databases. (in Russian) Moscow, Nauka (1989)

    Google Scholar 

  13. Ullman J. Principles of database and knowledge-base systems. Computer science press (1988)

    Google Scholar 

  14. Zimmerman K. Different views of a database: coexistence between network model and relational model Technical report TR 25.143, IBM laboratory Vienna (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Bar-Ilan University, 52-900, Ramat-Gan, Israel

    Tatjana L. Plotkin

Authors
  1. Tatjana L. Plotkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Klagenfurt, Universitätsstraße 65, A-9020, Klagenfurt, Austria

    Johann Eder

  2. Institute for Problems of Informatics, Russian Academy of Sciences, Vavilov Street 30/6, 117900, V-334, Moscow, Russian Federation

    Leonid A. Kalinichenko

Rights and permissions

Reprints and permissions

Copyright information

© 1996 British Computer Society

About this paper

Cite this paper

Plotkin, T.L. (1996). Relational Databases Equivalence Problem. In: Eder, J., Kalinichenko, L.A. (eds) Advances in Databases and Information Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-1486-4_25

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-1486-4_25

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-76014-6

  • Online ISBN: 978-1-4471-1486-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation