Database Paper Browser

Back to papers

Efficient Querying of Inconsistent Databases with Binary Integer Programming

Summary: Proposes EQUIP for consistent query answering of conjunctive queries under primary-key constraints. It uses BIP to iteratively prune repairs that invalidate candidate answers, with proven correctness and scalability, outperforming prior systems when answers are not first-order rewritable. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10705
Venue
VLDB
Year
2013
Pagerank
7.0087032e-05
Overall Rank
3,524 | 75.49%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
49 Consistent Query Answers in Inconsistent Databases 1999 PODS 0.00067660624
365 On the Power of Magic 1987 PODS 0.00025585898
678 ConQuer: Efficient Management of Inconsistent Databases 2005 SIGMOD 0.00018253213
888 QAGen: Generating Query-Aware Test Databases 2007 SIGMOD 0.00015578618
Previous Page 1 / 1 Next

Semantically Similar Papers