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

Generalized schema-mappings: from termination to tractability

Published:29 June 2009Publication History

ABSTRACT

Data-Exchange is the problem of creating new databases according to a high-level specification called a schema-mapping while preserving the information encoded in a source database. This paper introduces a notion of generalized schema-mapping that enriches the standard schema-mappings (as defined by Fagin et al) with more expressive power. It then proposes a more general and arguably more intuitive notion of semantics that rely on three criteria: Soundness, Completeness and Laconicity (non-redundancy and minimal size). These semantics are shown to coincide precisely with the notion of cores of universal solutions in the framework of Fagin, Kolaitis and Popa. It is also well-defined and of interest for larger classes of schema-mappings and more expressive source databases (with null-values and equality constraints). After an investigation of the key properties of generalized schema-mappings and their semantics, a criterion called Termination of the Oblivious Chase (TOC) is identified that ensures polynomial data-complexity. This criterion strictly generalizes the previously known criterion of Weak-Acyclicity. To prove the tractability of TOC schema-mappings, a new polynomial time algorithm is provided that, unlike the algorithm of Gottlob and Nash from which it is inspired, does not rely on the syntactic property of Weak-Acyclicity. As the problem of deciding whether a Schema-mapping satisfies the TOC criterion is only recursively enumerable, a more restrictive criterion called Super-weak Acylicity (SwA) is identified that can be decided in Polynomial-time while generalizing substantially the notion of Weak-Acyclicity.

References

  1. ]]A. Deutsch, A. Nash, and J. Remmel. The chase revisited. In PODS 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. ]]A. Deutsch and V. Tannen. Reformulation of xml queries and constraints. In ICDT 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. ]]R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. In ICDT 2003, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. ]]R. Fagin, P. G. Kolaitis, and L. Popa. Data exchange: getting to the core. In ACM Trans. Database Syst., volume 30, pages 174--210. ACM Press, March 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. ]]G. Gottlob. Computing cores for data exchange: new algorithms and practical solutions. In PODS '05, pages 148--159. ACM, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. ]]G. Gottlob and A. Nash. Data exchange: computing cores in polynomial time. In PODS 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. ]]L. Lipkin and C. Sirangelo. Data-exchange and schema-mappings in open and closed worlds. In PODS 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. ]]R. Pichler and V. Savenkov. Towards practical feasibility of core computation in data exchange. In LPAR 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. ]]M. Schmidt, M. Meier, and G. Lausen. Foundations of sparql query optimization. In CoRR.Google ScholarGoogle Scholar

Index Terms

  1. Generalized schema-mappings: from termination to tractability

            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
              PODS '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
              June 2009
              298 pages
              ISBN:9781605585536
              DOI:10.1145/1559795
              • General Chair:
              • Jan Paredaens,
              • Program Chair:
              • Jianwen Su

              Copyright © 2009 ACM

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 29 June 2009

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-article

              Acceptance Rates

              Overall Acceptance Rate476of1,835submissions,26%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader
            About Cookies On This Site

            We use cookies to ensure that we give you the best experience on our website.

            Learn more

            Got it!