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

Data exchange beyond complete data

Published:13 June 2011Publication History

ABSTRACT

In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural for a typical database translation scenario, this restriction is gradually becoming an impediment to the development of a wide range of applications that need to exchange objects that admit several interpretations. In particular, we are motivated by two specific applications that go beyond the usual data exchange scenario: exchanging incomplete information and exchanging knowledge bases.

In this paper, we propose a general framework for data exchange that can deal with these two applications. More specifically, we address the problem of exchanging information given by representation systems, which are essentially finite descriptions of (possibly infinite) sets of complete instances. We make use of the classical semantics of mappings specified by sets of logical sentences to give a meaningful semantics to the notion of exchanging representatives, from which the standard notions of solution, space of solutions, and universal solution naturally arise. We also introduce the notion of strong representation system for a class of mappings, that resembles the concept of strong representation system for a query language. We show the robustness of our proposal by applying it to the two applications mentioned above: exchanging incomplete information and exchanging knowledge bases, which are both instantiations of the exchanging problem for representation systems. We study these two applications in detail, presenting results regarding expressiveness, query answering and complexity of computing solutions, and also algorithms to materialize solutions.

References

  1. S. Abiteboul, P. C. Kanellakis, and G. Grahne. On the representation and querying of sets of possible worlds. TCS, 78(1):158--187, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. F. Afrati, C. Li, and V. Pavlaki. Data exchange: Query answering for incomplete data sources. In InfoScale, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. L. Antova, C. Koch, and D. Olteanu. 1010 6 worlds and beyond: Efficient representation and processing of incomplete information. In ICDE, pages 606--615, 2007.Google ScholarGoogle Scholar
  4. M. Arenas, J. Pérez, J. L. Reutter, and C. Riveros. Foundations of schema mapping management. In PODS, pages 227--238, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. Arenas, J. Pérez, J. L. 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
  6. M. Arenas, J. Pérez, and C. Riveros. The recovery of a schema mapping: Bringing exchanged data back. TODS, 34(4), 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. P. Bernstein. Applying model management to classical meta data problems. In CIDR, 2003.Google ScholarGoogle Scholar
  8. P. Bernstein and S. Melnik. Model management 2.0: manipulating richer mappings. In SIGMOD, pages 1--12, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. Artif. Intell., 109(1-2):297--356, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Deutsch and V. Tannen. Reformulation of XML queries and constraints. In ICDT, pages 225--241, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. T. Eiter and G. Gottlob. On the complexity of propositional knowledge base revision, updates, and counterfactuals. In PODS, pages 261--273, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. R. Fagin. Inverting schema mappings. TODS, 32(4), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: semantics and query answering. TCS, 336(1):89--124, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. R. Fagin, P. G. 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
  15. R. Fagin, P. G. Kolaitis, L. Popa, and W.-C. Tan. Quasi-inverses of schema mappings. In PODS, pages 123--132, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. R. Fagin, P. G. Kolaitis, L. Popa, and W.-C. Tan. Reverse data exchange: coping with nulls. In PODS, pages 23--32, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. G. Grahne. The Problem of Incomplete Information in Relational Databases. Springer, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. G. Grahne, A. Onet. Closed World Chasing. In LID 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. P. Hayes. RDF Semantics, W3C Recommendation. February 2004.Google ScholarGoogle Scholar
  20. T. Imielinski and W. Lipski. Incomplete information in relational databases. Journal of the ACM, 31(4):761--791, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. L. Libkin. Data exchange and incomplete information. In PODS, pages 60--69, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. L. Libkin and C. Sirangelo. Data exchange and schema mappings in open and closed worlds. In PODS, pages 139--148, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. D. Maier, A. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. TODS, 4(4):455--469, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. P. F. Patel-Schneider, P. Hayes, and I. Horrocks. OWL Web Ontology Language, W3C Recommendation. February 2004.Google ScholarGoogle Scholar
  25. K. W. Wagner. More complicated questions about maxima and minima, and some closures of NP. TCS, 51:53--80, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Data exchange beyond complete data

      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

      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!