This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th International Conference on Database and Expert Systems Applications (DEXA'06)
Consistent Query Answering By Minimal-Size Repairs
Krakow, Poland
September 04-September 08
ISBN: 0-7695-2641-1
Andrei Lopatenko, Free University of Bozen-Bolzano, Italy
Leopoldo Bertossi, Carleton University, Canada
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consistent wrt IC . Consistent answers have been characterized as those that are invariant under certain minimal forms of restoration of the consistency of the database. In this paper we investigate algorithmic and complexity theoretic issues of CQA under database repairs that minimally depart -wrt the cardinality of the symmetric difference- from the original database. Research on this kind of repairs had been suggested in the literature, but no systematic study had been done. Here we obtain first tight complexity bounds.
Citation:
Andrei Lopatenko, Leopoldo Bertossi, "Consistent Query Answering By Minimal-Size Repairs," dexa, pp.558-562, 17th International Conference on Database and Expert Systems Applications (DEXA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.