Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Calculating constraints on relational expression
ACM Transactions on Database Systems (TODS)
Census Data Repair: a Challenging Application of Disjunctive Logic Programming
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Logics for Emerging Applications of Databases
Logics for Emerging Applications of Databases
A cost-based model and effective heuristic for repairing constraints by value modification
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Database repairing using updates
ACM Transactions on Database Systems (TODS)
Annotation based query answer over inconsistent database
Journal of Computer Science and Technology
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
| Hi-index | 0.01 |
In this paper, we introduce an annotation based data model of relational database that may violate a set of functional dependency. In the data model, every piece of data in a relation can have zero or more annotations with it and annotations are propagated along with queries from the source to the output. With annotations, data in both input data and query answer can be divided into certain and uncertain part down to cell level. It can avoid information loss. To query an annotated database, we propose an extension of SPJ-UNION SQL, CASQL, and algorithms for evaluating CASQL so that annotations can be correctly propagated as the valid set of functional dependency changes during query processing. Last, we present a set of performance experiments which show that time performance of our approach is acceptable, but performance in information preserving is excellent.