Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Incomplete object—a data model for design and planning applications
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
A probabilistic relational model for the integration of IR and databases
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
ACM Transactions on Database Systems (TODS)
A probabilistic relational model and algebra
ACM Transactions on Database Systems (TODS)
A probabilistic relational algebra for the integration of information retrieval and database systems
ACM Transactions on Information Systems (TOIS)
Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
ACM Transactions on Database Systems (TODS)
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A Logical Framework for Querying and Repairing Inconsistent Databases
IEEE Transactions on Knowledge and Data Engineering
Answer sets for consistent query answering in inconsistent databases
Theory and Practice of Logic Programming
Aggregate operators in probabilistic databases
Journal of the ACM (JACM)
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)
Clean Answers over Dirty Databases: A Probabilistic Approach
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Consistent query answering in databases
ACM SIGMOD Record
First-order query rewriting for inconsistent databases
Journal of Computer and System Sciences
Management of probabilistic data: foundations and challenges
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The dichotomy of conjunctive queries on probabilistic structures
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient query evaluation on probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient query evaluation on probabilistic databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Improving data quality: consistency and accuracy
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Databases with uncertainty and lineage
The VLDB Journal — The International Journal on Very Large Data Bases
A three-valued semantics for querying and repairing inconsistent databases
Annals of Mathematics and Artificial Intelligence
Approximate Probabilistic Query Answering over Inconsistent Databases
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
Consistent query answering under primary keys: a characterization of tractable queries
Proceedings of the 12th International Conference on Database Theory
Representing uncertain data: models, properties, and algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
Minimal-change integrity maintenance using tuple deletions
Information and Computation
Querying inconsistent databases
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Querying and repairing inconsistent databases under three-valued semantics
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th international conference on Database Theory
Representation of partial knowledge and query answering in locally complete databases
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Consistent query answers on numerical databases under aggregate constraints
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
First-order query rewriting for inconsistent databases
ICDT'05 Proceedings of the 10th international conference on Database Theory
Project-Join-Repair: an approach to consistent query answering under functional dependencies
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Hi-index | 0.00 |
This paper presents a framework for querying inconsistent databases in the presence of functional dependencies. Most of the works dealing with the problem of extracting reliable information from inconsistent databases are based on the notion of repair, a minimal set of tuple insertions and deletions which leads the database to a consistent state (called repaired database), and the notion of consistent query answer, a query answer that can be obtained from every repaired database. In this work, both the notion of repair and query answer differ from the original ones. In the presence of functional dependencies, tuple deletions are the only operations that are performed in order to restore the consistency of an inconsistent database. However, deleting a tuple to remove an integrity violation potentially eliminates useful information in that tuple. In order to cope with this problem, we adopt a notion of repair, based on tuple updates, which allows us to better preserve information in the source database. A drawback of the notion of consistent query answer is that it does not allow us to discriminate among non-consistent answers, namely answers which can be obtained from a non-empty proper subset of the repaired databases. To obtain more informative query answers, we propose the notion of probabilistic query answer, that is query answers are tuples associated with probabilities. This new semantics of query answering over inconsistent databases allows us to give a measure of uncertainty to query answers. We show that the problem of computing probabilistic query answers is FP #P -complete. We also propose a technique for computing probabilistic answers to arbitrary relational algebra queries.