Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Approximate inclusion-exclusion
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
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
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
A Logical Framework for Querying and Repairing Inconsistent Databases
IEEE Transactions on Knowledge and Data Engineering
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
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
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Minimal-change integrity maintenance using tuple deletions
Information and Computation
Consistent query answering: five easy pieces
ICDT'07 Proceedings of the 11th 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
Exploiting conflict structures in inconsistent databases
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Sampling the repairs of functional dependency violations under hard constraints
Proceedings of the VLDB Endowment
Maintaining consistency of probabilistic databases: a linear programming approach
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Proceedings of the 4th International Workshop on Logic in Databases
FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
Probabilistic query answering over inconsistent databases
Annals of Mathematics and Artificial Intelligence
A dichotomy in the complexity of counting database repairs
Journal of Computer and System Sciences
Sampling from repairs of conditional functional dependency violations
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
The problem of managing and querying inconsistent databases has been deeply investigated in the last few years. Most of the approaches proposed so far rely on the notion of repair(a minimal set of delete/insert operations making the database consistent) and consistent query answer(the answer to a query is given by considering the set of `repaired' databases). Since the problem of consistent query answering is hard in the general case, most of the proposed techniques have an exponential complexity, although for special classes of constraints and queries the problem becomes polynomial. A second problem with most of the proposed approaches is that repairs do not take into account update operations (they consider delete and insert operations only).This paper presents a general framework where constraints consist of functional dependencies and queries may be expressed by positive relational algebra. The framework allows us to compute certain (i.e. tuples derivable from all or from none of the repaired databases) and uncertain query answers (i.e. tuples derivable from a proper not empty subset of the repaired databases). Each tuple in the answer is associated with a probability, which depends on the number of repaired databases from which the tuple can be derived. In the proposed framework, databases are repaired by means of update operations and repaired databases are stored by means of a "condensed" database, so that all the repaired databases can be derived by "expanding" the unique condensed database. A condensed database can be rewritten into a probabilistic database where each tuple is associated with an event (i.e. a boolean formula) and, thus, a probability value. The probabilistic query answer can be computed by querying the so obtained probabilistic database. As the complexity of querying probabilistic databases is #P-complete, approximate probabilistic answers which are computable in polynomial time are considered.