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

Value invention in data exchange

Published:22 June 2013Publication History

ABSTRACT

The creation of values to represent incomplete information, often referred to as value invention, is central in data exchange. Within schema mappings, Skolem functions have long been used for value invention as they permit a precise representation of missing information. Recent work on a powerful mapping language called second-order tuple generating dependencies (SO tgds), has drawn attention to the fact that the use of arbitrary Skolem functions can have negative computational and programmatic properties in data exchange. In this paper, we present two techniques for understanding when the Skolem functions needed to represent the correct semantics of incomplete information are computationally well-behaved. Specifically, we consider when the Skolem functions in second-order (SO) mappings have a first-order (FO) semantics and are therefore programmatically and computationally more desirable for use in practice. Our first technique, linearization, significantly extends the Nash, Bernstein and Melnik unskolemization algorithm, by understanding when the sets of arguments of the Skolem functions in a mapping are related by set inclusion. We show that such a linear relationship leads to mappings that have FO semantics and are expressible in popular mapping languages including source-to-target tgds and nested tgds. Our second technique uses source semantics, specifically functional dependencies (including keys), to transform SO mappings into equivalent FO mappings. We show that our algorithms are applicable to a strictly larger class of mappings than previous approaches, but more importantly we present an extensive experimental evaluation that quantifies this difference (about 78% improvement) over an extensive schema mapping benchmark and illustrates the applicability of our results on real mappings.

References

  1. B. Alexe, M. A. Hernández, L. Popa, and W. C. Tan. MapMerge: Correlating Independent Schema Mappings. VLDB J., 21(2):191--211, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. B. Alexe, W. C. Tan, and Y. Velegrakis. STBenchmark: Towards a Benchmark for Mapping Systems. PVLDB, 1(1):230--244, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. B. Alexe, B. ten Cate, P. Kolaitis, and W. Tan. Designing and refining schema mappings via data examples. In SIGMOD, pages 133--144, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Y. An, A. Borgida, R. J. Miller, and J. Mylopoulos. A Semantic Approach to Discovering Schema Mapping Expressions. In ICDE, pages 206--215, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  5. M. Arenas, R. Fagin, and A. Nash. Composition with Target Constraints. Logical Methods in Comput. Sci., 7(3), 2011.Google ScholarGoogle Scholar
  6. M. Arenas, J. Pérez, J. Reutter, and C. Riveros. Inverting Schema Mappings: Bridging the Gap between Theory and Practice. PVLDB, 2(1):1018--1029, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. P. C. Arocena, M. D'Angelo, B. Glavic, and R. J. Miller. STBenchmark 2.0. Technical report, University of Toronto, 2013. http://dblab.cs.toronto.edu/project/STBench2.0.Google ScholarGoogle Scholar
  8. P. A. Bernstein, T. J. Green, S. Melnik, and A. Nash. Implementing Mapping Composition. VLDB J., 17(2):333--353, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. P. A. Bernstein, A. Y. Halevy, and R. A. Pottinger. A Vision for Management of Complex Models. SIGMOD Record, 29(4):55--63, Dec. 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. H. B. Enderton. A Mathematical Introduction to Logic. Harcout Academic Press, 2nd. Edition, 2001.Google ScholarGoogle Scholar
  11. R. Fagin, P. Kolaitis, R. J. Miller, and L. Popa. Data Exchange: Semantics and Query Answering. Theor. Comput. Sci., 336(1):89--124, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. R. Fagin, P. Kolaitis, L. Popa, and W. C. Tan. Composing Schema Mappings: Second-Order Dependencies to the Rescue. TODS, 30(4):994--1055, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. I. Feinerer, R. Pichler, E. Sallinger, and V. Savenkov. On the Undecidability of the Equivalence of Second-Order Tuple Generating Dependencies. In AMW, 2011.Google ScholarGoogle Scholar
  14. A. Fuxman, M. A. Hernandez, H. Ho, R. J. Miller, P. Papotti, and L. Popa. Nested Mappings: Schema Mapping Reloaded. In VLDB, pages 67--78, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. Fuxman, P. Kolaitis, R. J. Miller, and W. C. Tan. Peer Data Exchange. TODS, 31(4):1454--1498, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. D. Gabbay, R. Schmidt, and A. Szalas. Second Order Quantifier Elimination: Foundations, Computational Aspects and Applications. College Publications, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. T. J. Green, G. Karvounarakis, N. E. Taylor, O. Biton, Z. G. Ives, and V. Tannen. ORCHESTRA: Facilitating Collaborative Data Sharing. In SIGMOD, pages 1131--1133, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. R. Hull and M. Yoshikawa. ILOG: Declarative Creation and Manipulation of Object Identifiers. In VLDB, pages 455--468, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. A. Klug and R. Price. Determining View Dependencies Using Tableaux. TODS, 7(3):361--380, 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. M. K. Lawrence, R. A. Pottinger, and S. Staub-French. Data Coordination: Supporting Contingent Updates. PVLDB, 4(11):831--842, 2011.Google ScholarGoogle Scholar
  21. M. Lenzerini. Data Integration: a Theoretical Perspective. In PODS, pages 233--246, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. L. Libkin and C. Sirangelo. Data Exchange and Schema Mappings in Open and Closed Worlds. J. Comput. Syst. Sci., 77(3):542--571, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. B. Marnette, G. Mecca, and P. Papotti. Scalable Data Exchange with Functional Dependencies. PVLDB, 3(1):105--116, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. B. Marnette, G. Mecca, P. Papotti, S. Raunich, and D. Santoro. ++Spicy: an OpenSource Tool for Second-Generation Schema Mapping and Data Exchange. PVLDB, 4(12):1438--1441, 2011.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. R. J. Miller, D. Fisla, M. Huang, D. Kymlicka, F. Ku, and V. Lee. The Amalgam Schema and Data Integration Test Suite. www.cs.toronto.edu/~miller/amalgam, 2001.Google ScholarGoogle Scholar
  26. A. Nash, P. A. Bernstein, and S. Melnik. Composition of Mappings Given by Embedded Dependencies. TODS, 32(1):4, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Y. Papakonstantinou, S. Abiteboul, and H. Garcia-Molina. Object Fusion in Mediator Systems. In VLDB, pages 413--424, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. R. Pichler and S. Skritek. The Complexity of Evaluating Tuple Generating Dependencies. In ICDT, pages 244--255, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. L. Popa, Y. Velegrakis, R. J. Miller, M. A. Hernandez, and R. Fagin. Translating Web Data. In VLDB, pages 598--609, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. L. Seligman, P. Mork, A. Y. Halevy, K. P. Smith, M. J. Carey, K. Chen, C. Wolf, J. Madhavan, A. Kannan, and D. Burdick. OpenII: an Open Source Information Integration Toolkit. In SIGMOD, pages 1057--1060, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. B. ten Cate and P. Kolaitis. Structural Characterizations of Schema-Mapping Languages. In ICDT, pages 63--72, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. C. Yu and L. Popa. Semantic Adaptation of Schema Mappings when Schemas Evolve. VDLB, pages 1006--1017, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Value invention in data exchange

      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 '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
        June 2013
        1322 pages
        ISBN:9781450320375
        DOI:10.1145/2463676

        Copyright © 2013 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 ACM 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: 22 June 2013

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        SIGMOD '13 Paper Acceptance Rate76of372submissions,20%Overall Acceptance Rate785of4,003submissions,20%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader