• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Data Exchange: Semantics and Query Answering (2003)

Cached

  • Download as a PDF

Download Links

  • [www.almaden.ibm.com]
  • [queens.db.toronto.edu]
  • [www.almaden.ibm.com]
  • [www.almaden.ibm.com]
  • [www.almaden.ibm.com]
  • [queens.db.toronto.edu]
  • [www.db.toronto.edu]
  • [www.cs.toronto.edu]
  • [www.almaden.ibm.com]
  • [www.cn.ntua.gr]
  • [cs.uwaterloo.ca]
  • [www.almaden.ibm.com]
  • [www.almaden.ibm.com]
  • [researcher.watson.ibm.com]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Ronald Fagin , Phokion G. Kolaitis , Renee J. Miller , Lucian Popa
Venue:In ICDT
Citations:426 - 41 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Fagin03dataexchange:,
    author = {Ronald Fagin and Phokion G. Kolaitis and Renee J. Miller and Lucian Popa},
    title = {Data Exchange: Semantics and Query Answering},
    booktitle = {In ICDT},
    year = {2003},
    pages = {207--224}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. In this paper, we address foundational and algorithmic issues related to the semantics of data exchange and to query answering in the context of data exchange. These issues arise because, given a source instance, there may be many target instances that satisfy the constraints of the data exchange problem. We give an algebraic specification that selects, among all solutions to the data exchange problem, a special class of solutions that we call universal. A universal solution has no more and no less data than required for data exchange and it represents the entire space of possible solutions. We then identify fairly general, and practical, conditions that guarantee the existence of a universal solution and yield algorithms to compute a canonical universal solution efficiently. We adopt the notion of "certain answers" in indefinite databases for the semantics for query answering in data exchange. We investigate the computational complexity of computing the certain answers in this context and also study the problem of computing the certain answers of target queries by simply evaluating them on a canonical universal solution.

Keyphrases

data exchange    query answering    certain answer    data exchange problem    canonical universal solution    universal solution    computational complexity    algorithmic issue    source schema    target query    indefinite database    possible solution    special class    many target instance    source data    yield algorithm    algebraic specification    target schema    source instance    entire space   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University