Database Paper Browser

Back to papers

The Computation of Optimal Subset Repairs

Summary: New tight inapproximability for optimal subset repairs: NP-hard to approximate within 17/16. Presents a (2 - 1/2^{sigma-1})-approx algorithm (sigma = number of FDs), the current best; ratio improves with many quasi-Turan clusters; validated on real data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12100
Venue
VLDB
Year
2020
Pagerank
4.6020746e-05
Overall Rank
8,014 | 44.31%
DOI
10.14778/3407790.3407809

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
8,839 The Cost of Representation by Subset Repairs 2025 VLDB 4.4346105e-05
10,213 Stress-Testing Causal Claims via Cardinality Repairs 2026 SIGMOD 4.1905499e-05
11,197 rkHit: Representative Query with Uncertain Preference 2023 SIGMOD 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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