skip to main content
10.1145/3035918.3064046acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Living in Parallel Realities: Co-Existing Schema Versions with a Bidirectional Database Evolution Language

Published:09 May 2017Publication History

ABSTRACT

We introduce end-to-end support of co-existing schema versions within one database. While it is state of the art to run multiple versions of a continuously developed application concurrently, it is hard to do the same for databases. In order to keep multiple co-existing schema versions alive -- which are all accessing the same data set -- developers usually employ handwritten delta code (e.g. views and triggers in SQL). This delta code is hard to write and hard to maintain: if a database administrator decides to adapt the physical table schema, all handwritten delta code needs to be adapted as well, which is expensive and error-prone in practice. In this paper, we present InVerDa: developers use the simple bidirectional database evolution language BiDEL, which carries enough information to generate all delta code automatically. Without additional effort, new schema versions become immediately accessible and data changes in any version are visible in all schema versions at the same time. InVerDa also allows for easily changing the physical table design without affecting the availability of co-existing schema versions. This greatly increases robustness (orders of magnitude less lines of code) and allows for significant performance optimization. A main contribution is the formal evaluation that each schema version acts like a common full-fledged database schema independently of the chosen physical table design.

References

  1. M. Arora and A. Gosain. Article: Schema Evolution for Data Warehouse: A Survey. International Journal of Computer Applications, 22(5):6--14, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  2. A. Behrend, U. Griefahn, H. Voigt, and P. Schmiegelt. Optimizing continuous queries using update propagation with varying granularities. In SSDBM '15, pages 1--12, New York, USA, jun 2015. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. P. A. Bernstein and S. Melnik. Model management 2.0. In Proceedings of the 2007 ACM SIGMOD international conference on Management of data - SIGMOD '07, page 1, New York, New York, USA, 2007. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. L. Brodie and J. T. Liu. Keynote: The Power and Limits of Relational Technology In the Age of Information Ecosystems. In OTM'10, pages 2--3, 2010.Google ScholarGoogle Scholar
  5. C. Curino, H. J. Moon, A. Deutsch, and C. Zaniolo. Automating the database schema evolution process. VLDB Journal, 22(1):73--98, dec 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. C. Curino, H. J. Moon, and C. Zaniolo. Graceful database schema evolution: the PRISM workbench. VLDB Endowment, 1(1):761--772, aug 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Curino, L. Tanca, H. J. Moon, and C. Zaniolo. Schema evolution in wikipedia: toward a web information system benchmark. In ICEIS, pages 323--332, 2008.Google ScholarGoogle Scholar
  8. E. Domínguez, J. Lloret, Á. L. Rubio, and M. a. Zapata. MeDEA: A database evolution architecture with traceability. Data and Knowledge Engineering, 65(3):419--441, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. K. Herrmann, H. Voigt, A. Behrend, and W. Lehner. CoDEL - A Relationally Complete Language for Database Evolution. In ADBIS '15, pages 63--76, Poitiers, France, 2015. Springer.Google ScholarGoogle ScholarCross RefCross Ref
  10. K. Herrmann, H. Voigt, T. Seyschab, and W. Lehner. InVerDa -- co-existing schema versions made foolproof. In ICDE '16, pages 1362--1365. IEEE, 2016.Google ScholarGoogle ScholarCross RefCross Ref
  11. M. Hofmann, B. Pierce, and D. Wagner. Symmetric lenses. ACM SIGPLAN Notices - POPL '11, 46(1):371, jan 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. P. Howard. Data Migration Report, 2011.Google ScholarGoogle Scholar
  13. H. J. Moon, C. Curino, M. Ham, and C. Zaniolo. PRIMA - archiving and querying historical data with evolving schemas. In SIGMOD '09, pages 1019--1022. ACM Press, jun 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. E. Rahm and P. a. Bernstein. An online bibliography on schema evolution. ACM SIGMOD Record, 35(4):30--31, dec 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. F. Roddick. SQL/SE - A Query Language Extension for Databases Supporting Schema Evolution. ACM SIGMOD Record, 21(2):10--16, sep 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. F. Roddick. A survey of schema versioning issues for database systems. Information and Software Technology, 37(7):383--393, 1995.Google ScholarGoogle ScholarCross RefCross Ref
  17. J. F. Terwilliger, A. Cleve, and C. Curino. How Clean Is Your Sandbox? Lecture Notes in Computer Science, 7307:1--23, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. B. Wall and R. Angryk. Minimal data sets vs. synchronized data copies in a schema and data versioning system. In PIKM '11, page 67, New York, USA, oct 2011. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Living in Parallel Realities: Co-Existing Schema Versions with a Bidirectional Database Evolution Language

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SIGMOD '17: Proceedings of the 2017 ACM International Conference on Management of Data
          May 2017
          1810 pages
          ISBN:9781450341974
          DOI:10.1145/3035918

          Copyright © 2017 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 9 May 2017

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate785of4,003submissions,20%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader