Affiliation:
1. Université de Mons-Hainaut, Mons, Belgium
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.
Publisher
Association for Computing Machinery (ACM)
Reference40 articles.
1. Abiteboul S. Hull R. and Vianu V. 1995. Foundations of Databases. Addison-Wesley.]] Abiteboul S. Hull R. and Vianu V. 1995. Foundations of Databases. Addison-Wesley.]]
2. Consistent query answers in inconsistent databases
3. Answer sets for consistent query answering in inconsistent databases
4. Scalar aggregation in inconsistent databases
Cited by
139 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献