%0 Conference Paper %1 1066176 %A Fuxman, Ariel %A Fazli, Elham %A Miller, Renée J. %B SIGMOD '05: Proceedings of the 2005 ACM SIGMOD international conference on Management of data %C New York, NY, USA %D 2005 %I ACM %K inconsistent %P 155--166 %R http://doi.acm.org/10.1145/1066157.1066176 %T ConQuer: efficient management of inconsistent databases %U http://www.cs.toronto.edu/~afuxman/publications/sigmod05.pdf %X 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 paper, we present 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.We study the overhead of resolving inconsistencies dynamically (at query time). In particular, we present a set of performance experiments that compare the efficiency of the rewriting strategies used by ConQuer. The experiments use queries taken from the TPC-H workload. We show that the overhead is not onerous, and the consistent query answers can often be computed within twice the time required to obtain the answers to the original (non-rewritten) query. %@ 1-59593-060-4

@inproceedings{1066176, 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 paper, we present 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.We study the overhead of resolving inconsistencies dynamically (at query time). In particular, we present a set of performance experiments that compare the efficiency of the rewriting strategies used by ConQuer. The experiments use queries taken from the TPC-H workload. We show that the overhead is not onerous, and the consistent query answers can often be computed within twice the time required to obtain the answers to the original (non-rewritten) query.}, added-at = {2008-10-04T16:08:45.000+0200}, address = {New York, NY, USA}, author = {Fuxman, Ariel and Fazli, Elham and Miller, Ren\'{e}e J.}, biburl = {https://www.bibsonomy.org/bibtex/2062f3cac5f0ff1deb1a1939ceb156001/ljiang}, booktitle = {SIGMOD '05: Proceedings of the 2005 ACM SIGMOD international conference on Management of data}, description = {ConQuer}, doi = {http://doi.acm.org/10.1145/1066157.1066176}, interhash = {104175c5a0b32130c0fd0d798f61ff86}, intrahash = {062f3cac5f0ff1deb1a1939ceb156001}, isbn = {1-59593-060-4}, keywords = {inconsistent}, location = {Baltimore, Maryland}, pages = {155--166}, publisher = {ACM}, timestamp = {2008-10-13T18:08:14.000+0200}, title = {ConQuer: efficient management of inconsistent databases}, url = {http://www.cs.toronto.edu/~afuxman/publications/sigmod05.pdf}, year = 2005 }