ACM Home Page
Please provide us with feedback. Feedback
Data exchange and incomplete information
Full text PdfPdf (222 KB)
Source Symposium on Principles of Database Systems archive
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems table of contents
Chicago, IL, USA
SESSION: Data exchange table of contents
Pages: 60 - 69  
Year of Publication: 2006
ISBN:1-59593-318-2
Author
Leonid Libkin  University of Toronto and University of Edinburgh
Sponsors
SIGMOD: ACM Special Interest Group on Management of Data
SIGART: ACM Special Interest Group on Artificial Intelligence
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 90,   Citation Count: 13
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1142351.1142360
What is a DOI?

ABSTRACT

Data exchange is the problem of finding an instance of a target schema, given an instance of a source schema and a specification of the relationship between the source and the target, and answering queries over target instances in a way that is semantically consistent with the information in the source. Theoretical foundations of data exchange have been actively explored recently. It was also noticed that the standard certain answers semantics may behave in very odd ways.In this paper I explain that this behavior is due to the fact that the presence of incomplete information in target instances has been ignored; in particular, proper query evaluation techniques for databases with nulls have not been used, and the distinction between closed and open world semantics has not been made. I present a concept of target solutions based on the closed world assumption, and show that the space of all solutions has two extreme points: the canonical universal solution and the core, well studied in data exchange. I show how to define semantics of query answering taking into account incomplete information, and show that the well-known anomalies go away with the new semantics. The paper also contains results on the complexity of query answering, upper approximations to queries (maybe-answers), and various extensions.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
4
5
6
7
 
8
 
9
 
10
11
12
13
 
14
 
15
 
16
17
18
 
19
 
20
 
21
22
 
23
24
 
25
L. Popa, Y. Velegrakis, R. Miller, M. Hernández, R. Fagin. Translating web data. In VLDB 2002, pages 598--609.
 
26
R. Reiter. On closed world databases. In "Logic and Databases", H. Gallaire and J. Minker eds, Plenum Press, 1978, pages 55--76.
 
27
R. Reiter. Towards a logical reconstruction of relational database theory. In: "On Conceptual Modeling" (M. Brodie and J. Schmidt eds.), Springer Verlag, 1984, pages 163--189.
28
29
 
30
C. Zaniolo. Database relations with null values. Journal of Computer and System Sciences 28 (1984), 142--166.

CITED BY  13