Database Paper Browser

Back to papers

CAvSAT: Answering Aggregation Queries over Inconsistent Databases via SAT Solving

Summary: CAvSAT: CQA via SAT reductions for SPJ queries with SUM/COUNT aggregations on inconsistent databases. First to support unions of SPJ with aggregation under keys, FDs, and denial constraints, via natural reductions to SAT and its optimization variants for consistent answers. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6031
Venue
SIGMOD
Year
2021
Pagerank
4.3690661e-05
Overall Rank
9,250 | 35.65%
DOI
10.1145/3448016.3452749

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,899 Consistent Query Answering for Primary Keys on Rooted Tree Queries 2024 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers