Prioritized Repairing and Consistent Query Answering in Relational Databases

Details Prioritized Repairing and Consistent Query Answering in Relational Databases Prioritized Repairing and Consistent Query Answering in Relational Databases

2009-08-04

arxiv.org/abs/0908.0464v3

Computer Science

Databases

Accepted to the special SUM'08 issue of AMAI

Scientific paper

A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how conflicts should be resolved. We investigate here the framework of preferred consistent query answers, in which user preferences are used to narrow down the set of repairs to a set of preferred repairs. We axiomatize desirable properties of preferred repairs. We present three different families of preferred repairs and study their mutual relationships. Finally, we investigate the complexity of preferred repairing and computing preferred consistent query answers.

Affiliated with

Also associated with

No associations

Rating

Prioritized Repairing and Consistent Query Answering in Relational Databases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Prioritized Repairing and Consistent Query Answering in Relational Databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prioritized Repairing and Consistent Query Answering in Relational Databases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-557246