DBScholar

Back to papers

The Computation of Optimal Subset Repairs

Summary: Studies optimal subset repairs for inconsistent databases, establishing a tighter 17/16 inapproximability threshold. Provides the best known (2−1/2^(σ−1))-approximation for σ FDs, with improved ratios on quasi-Turán clusters and empirical validation. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
he390641022574b83
Venue
VLDB
Year
2020
Pagerank
5.363617e-05
Overall Rank
8,280 | 44.34%
DOI
10.14778/3407790.3407809

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{miao_vldb20,
        title = {{The Computation of Optimal Subset Repairs}},
        author = {Miao, Dongjing and Cai, Zhipeng and Li, Jianzhong and Gao, Xiangyu and Liu, Xianmin},
        journal = {PVLDB},
        series = {{VLDB} '20},
        volume = {13},
        number = {11},
        pages = {2061--2074},
        doi = {10.14778/3407790.3407809},
        url = {https://doi.org/10.14778/3407790.3407809},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
9,004 The Cost of Representation by Subset Repairs 2025 VLDB 5.2389669e-05
10,688 Stress-Testing Causal Claims via Cardinality Repairs 2026 SIGMOD 4.9793485e-05
11,712 rkHit: Representative Query with Uncertain Preference 2023 SIGMOD 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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