Database Paper Browser

Back to papers

Counting and Enumerating (Preferred) Database Repairs

Summary: Establishes data-complexity dichotomies for counting subset repairs (traditional and preference-based under common semantics) across the entire space of functional dependencies. Provides delay-guaranteed enumeration algorithms for preferred repairs even under general conflict graphs/hypergraphs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1719
Venue
PODS
Year
2017
Pagerank
4.6690279e-05
Overall Rank
7,701 | 46.48%
DOI
10.1145/3034786.3056107

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
2,574 Database Repairs and Consistent Query Answering: Origins and Further Developments 2019 PODS 8.5126812e-05
6,544 Properties of Inconsistency Measures for Databases 2021 SIGMOD 5.013741e-05
8,148 Evaluating Top-k Queries with Inconsistency Degrees 2020 VLDB 4.5717374e-05
8,839 The Cost of Representation by Subset Repairs 2025 VLDB 4.4346105e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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