ACM Home Page
Please provide us with feedback. Feedback
Database repairing using updates
Full text PdfPdf (486 KB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 30 ,  Issue 3  (September 2005) table of contents
Pages: 722 - 768  
Year of Publication: 2005
ISSN:0362-5915
Author
Jef Wijsen  Université de Mons-Hainaut, Mons, Belgium
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 21,   Downloads (12 Months): 167,   Citation Count: 15
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/1093382.1093385
What is a DOI?

ABSTRACT

Repairing a database means bringing the database in accordance with a given set of integrity constraints by applying some minimal change. If a database can be repaired in more than one way, then the consistent answer to a query is defined as the intersection of the query answers on all repaired versions of the database.Earlier approaches have confined the repair work to deletions and insertions of entire tuples. We propose a theoretical framework that also covers updates as a repair primitive. Update-based repairing is interesting in that it allows rectifying an error within a tuple without deleting the tuple, thereby preserving consistent values in the tuple. Another novel idea is the construct of nucleus: a single database that yields consistent answers to a class of queries, without the need for query rewriting. We show the construction of nuclei for full dependencies and conjunctive queries. Consistent query answering and constructing nuclei is generally intractable under update-based repairing. Nevertheless, we also show some tractable cases of practical interest.


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
Arieli, O., Denecker, M., Nuffelen, B. V., and Bruynooghe, M. 2002. Repairing inconsistent databases: A model-theoretic approach and abductive reasoning. In Paraconsistent Computational Logic. Datalogiske Skrifter, vol. 95. Roskilde University, Roskilde, Denmark, 51--65.
 
8
Arieli, O., Denecker, M., Nuffelen, B. V., and Bruynooghe, M. 2004. Database repair by signed formulae. In Proceedings of the 3rd International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2004). LNCS, vol. 2942. Springer, 14--30.
9
 
10
Bertossi, L. E. and Chomicki, J. 2003. Query answering in inconsistent databases. In Logics for Emerging Applications of Databases, J. Chomicki, R. van der Meyden, and G. Saake, Eds. Springer, Chapter 2, 43--83.
 
11
 
12
 
13
Bravo, L. and Bertossi, L. E. 2003. Logic programs for consistently querying data integration systems. In Proceedings of the 18th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, 10--15.
 
14
 
15
 
16
17
 
18
Calì, A., Lembo, D., and Rosati, R. 2003b. Query rewriting and answering under constraints in data integration systems. In Proceedings of the 18th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, 16--21.
 
19
 
20
 
21
Chomicki, J. and Marcinkowski, J. 2005b. On the computational complexity of minimal-change integrity maintenance in relational databases. In Inconsistency Tolerance. LNCS, vol. 3300. Springer, 119--150.
22
 
23
Chomicki, J., Marcinkowski, J., and Staworko, S. 2004b. Hippo: A system for computing consistent answers to a class of SQL queries. In Proceedings of the 9th International Conference on Extending Database Technology (EDBT 2004). LNCS, vol. 2992. Springer, 841--844.
 
24
 
25
26
 
27
 
28
Fuxman, A. D. and Miller, R. J. 2005. First-order rewriting for inconsistent databases. In Proceedings of the 10th International Conference on Database Theory (ICDT 2005). LNCS, vol. 3363. Springer, 337--351.
 
29
 
30
 
31
Greco, S., Sirangelo, C., Trubitsyna, I., and Zumpano, E. 2003b. Preferred repairs for inconsistent databases. In 7th International Database Engineering and Applications Symposium (IDEAS 2003). IEEE Computer Society, 202--211.
 
32
 
33
Lembo, D., Lenzerini, M., and Rosati, R. 2002. Source inconsistency and incompleteness in data integration. In Proceedings of the 9th International Workshop on Knowledge Representation Meets Databases (KRDB 2002). Number 54 in CEUR Workshop Proceedings. Technical University of Aachen (RWTH).
 
34
Lin, J. and Mendelzon, A. O. 1998. Merging databases under constraints. Int. J. Cooperative Inf. Syst. 7, 1, 55--76.
 
35
Nair, M. 1982a. A new method in elementary prime number theory. J. London Math. Soc. 25, 385--391.
 
36
Nair, M. 1982b. On Chebyshev-type inequalities for primes. Amer. Math. Monthly 89, 126--129.
 
37
Plotkin, G. D. 1969. A note on inductive generalization. In Machine Intelligence 5, B. Meltzer and D. Michie, Eds. Edinburgh University Press, Edinburgh, 153--163.
38
 
39
 
40
Wijsen, J. 2004. Making more out of an inconsistent database. In Proceedings of the 8th East European Conference on Advances in Databases and Information Systems (ADBIS 2004). LNCS, vol. 3255. Springer, 291--305.

CITED BY  15