ConQuer: a system for efficient querying over inconsistent databases

Authors:
Ariel Fuxman;Diego Fuxman;Renée J. Miller
Affiliations:
University of Toronto, Toronto, Canada;Universidad Nacional del Sur, Bahía Blanca, Argentina;University of Toronto, Toronto, Canada
Venue:
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Year:
2005

Citing 3
Cited 2

Consistent query answers in inconsistent databases

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Exploratory Data Mining and Data Cleaning

Exploratory Data Mining and Data Cleaning
ConQuer: efficient management of inconsistent databases

Proceedings of the 2005 ACM SIGMOD international conference on Management of data

Data fusion

ACM Computing Surveys (CSUR)
On the tractability and intractability of consistent conjunctive query answering

Proceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although integrity constraints have long been used to maintain data consistency, there are situations in which they may not be enforced or satisfied. In this demo, we showcase ConQuer, a system for efficient and scalable answering of SQL queries on databases that may violate a set of constraints. ConQuer permits users to postulate a set of key constraints together with their queries. The system rewrites the queries to retrieve all (and only) data that is consistent with respect to the constraints. The rewriting is into SQL, so the rewritten queries can be efficiently optimized and executed by commercial database systems.