Database repairing using updates

被引:128
作者
Wijsen, J [1 ]
机构
[1] Univ Mons, B-7000 Mons, Belgium
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 2005年 / 30卷 / 03期
关键词
theory; consistent query answering; database repairing;
D O I
10.1145/1093382.1093385
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:722 / 768
页数:47
相关论文
共 40 条
[1]  
Abiteboul S., 1995, Foundations of databases, V1st
[2]   Answer sets for consistent query answering in inconsistent databases [J].
Arenas, M ;
Bertossi, L ;
Chomicki, J .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2003, 3 :393-424
[3]   Scalar aggregation in inconsistent databases [J].
Arenas, M ;
Bertossi, L ;
Chomicki, J ;
He, X ;
Raghavan, V ;
Spinrad, J .
THEORETICAL COMPUTER SCIENCE, 2003, 296 (03) :405-434
[4]  
Arenas M., 1999, Proceedings of the Eighteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, P68, DOI 10.1145/303976.303983
[5]  
ARENAS M, 2003, LECT NOTES ARTIF INT, V1861, P926
[6]  
Arieli O, 2004, LECT NOTES COMPUT SC, V2942, P14
[7]   An algorithmic approach to recover inconsistent knowledge-bases [J].
Arieli, O .
LOGICS IN ARTIFICIAL INTELLIGENCE, 2000, 1919 :148-162
[8]  
ARIELI O, 2002, P ICLP 02 WORKSH PAR, P51
[9]   A PROOF PROCEDURE FOR DATA DEPENDENCIES [J].
BEERI, C ;
VARDI, MY .
JOURNAL OF THE ACM, 1984, 31 (04) :718-741
[10]  
Bertossi L, 2004, LOGICS FOR EMERGING APPLICATIONS OF DATABASES, P43