ACM Home Page
Please provide us with feedback. Feedback
Consistent query answering in databases
Full text PdfPdf (327 KB)
Source ACM SIGMOD Record archive
Volume 35 ,  Issue 2  (June 2006) table of contents
COLUMN: Database principles table of contents
Pages: 68 - 76  
Year of Publication: 2006
ISSN:0163-5808
Author
Leopoldo Bertossi  Carleton University, Ottawa, Canada
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 115,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

For several reasons databases may become inconsistent with respect to a given set of integrity constraints (ICs): (a) The DBMS have no mechanism to maintain certain classes of ICs. (b) New constraints are imposed on preexisting, legacy data. (c) The ICs are soft, user, or informational constraints that are considered at query time, but without being necessarily enforced. (d) Data from different and autonomous sources are being integrated, in particular in mediator-based approaches.


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
Barcelo, P., Bertossi, L. and Bravo, L. Characterizing and Computing Semantically Correct Answers from Databases with Annotated Logic and Answer Sets. In Semantics of Databases, Springer LNCS 2582, 2003, pp. 1--27.
 
7
 
8
Bertossi, L. and Bravo, L. Consistent Query Answers in Virtual Data Integration Systems. In Inconsistency Tolerance, Springer LNCS 3300, 2004, pp. 42--83.
 
9
Bertossi, L. and Bravo, L. Query Answering in Peer-to-Peer Data Exchange Systems. Proc. EDBT International Workshop on Peer-to-Peer Computing & DataBases (P2P&DB 04), Springer LNCS 3268, 2004, pp. 478--485.
 
10
Bertossi, L., Bravo, L., Franconi, E. and Lopatenko, A. Fixing Numerical Attributes under Integrity Constraints. Proc. International Symposium on Database Programming Languages (DBPL 05), Springer LNCS 3774, 2005, pp. 262--278.
11
 
12
Bertossi, L. and Chomicki, J. Query Answering in Inconsistent Databases. In Logics for Emerging Applications of Databases. Springer, 2003, pp. 43--83.
 
13
Bravo, L. and Bertossi, L. Logic Programs for Consistently Querying Data Integration Systems. Proc. International Joint Conference in Artificial Intelligence (IJ-CAI 03), Morgan Kauffmann Publishers, 2003, pp. 10--15.
 
14
Bravo, L. and Bertossi, L. Disjunctive Deductive Databases for Computing Certain and Consistent Answers to Queries from Mediated Data Integration Systems. Journal of Applied Logic, 2005, 3(2):329--367.
 
15
Bravo, L. and Bertossi, L. Semantically Correct Query Answers in the Presence of Null Values. Proc. EDBT International Workshop on Inconsistency and Incompleteness in Databases (IIDB 06). To appear in Springer LNCS. Technical Report arXiv:cs.DB/0604076 v1. Posted April 19, 2006.
 
16
 
17
Cali, A., Calvanese, D., De Giacomo, G. and Lenzerini, M. On the Role of Integrity Constraints in Data Integration. IEEE Data Engineering Bulletin, 2002, 25(3): 39--45.
18
 
19
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M. and Rosati, R. Inconsistency Tolerance in P2P Data Integration: An Epistemic Logic Approach. Proc. International Symposium on Database Programming Languages (DBPL 05), Springer LNCS 3774, 2005, pp. 90--105.
 
20
 
21
22
 
23
24
 
25
Downey, R. G. and Fellows, M. R. Parameterized Complexity. Springer, Monographs in Computer Science, 1999.
 
26
Duschka, O., Genesereth, M. and Levy, A. Recursive Query Plans for Data Integration. Journal of Logic Programming, 2000, 43(1):49--73.
 
27
Eiter, T., Fink, M., Greco, G. and Lembo, D. Efficient Evaluation of Logic Programs for Querying Data Integration Systems. Proc. International Conference on Logic Programming (ICLP 03), Springer LNCS 2916, 2003, pp. 163--177. 2916, 2003.
 
28
 
29
Flesca, S., Furfaro, F. Parisi, F. Consistent Query Answers on Numerical Databases under Aggregate Constraints. Proc. International Symposium on Database Programming Languages (DBPL 05), Springer LNCS 3774, 2005, pp. 279--294.
 
30
 
31
 
32
Fuxman, A. and Miller, R. First-Order Query Rewriting for Inconsistent Databases. Proc. International Conference on Database Theory (ICDT 05), Springer LNCS 3363, 2004, pp. 337--351.
33
 
34
Gelfond, M. and Lifschitz, V. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 1991, 9:365--385.
 
35
 
36
37
38
 
39
Halevy, A., Ives, Z., Suciu, D. and Tatarinov, I. Schema Mediation in Peer Data Management Systems. Proc. Intenational Conference on Data Engineering (ICDE 03), IEEE Computer Society Press, 2003, pp. 505--518.
 
40
Immerman, N. Descriptive Complexity. Graduate Texts in Computer Science. Springer, 1999.
41
 
42
Lembo, D., Lenzerini, M. and Rosati, R. Source Inconsistency and Incompleteness in Data Integration. In Proc. International Workshop Knowledge Representation meets Databases (KRDB 02), CEUR Electronic Workshop Proceedings, 2002.
43
 
44
Lopatenko, A. and Bertossi, L. Complexity of Consistent Query Answering in Databases under Cardinality-Based and Incremental Repair Semantics. Technical Report arXiv:cs.DB/0604002 v1. Posted April 2, 2006.
 
45
 
46
 
47
Weber, V. and Schwentick, T. Dynamic Complexity Theory Revisited. Proc. Annual Symposium on Theoretical Aspects of Computer Science (STACS 05), Springer LNCS 3404, 2005, pp. 256--268.
 
48

CITED BY  12