DBScholar

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
h56bad204660f9f91
Venue
PODS
Year
2017
Pagerank
5.3774362e-05
Overall Rank
8,202 | 44.88%
DOI
10.1145/3034786.3056107

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{livshits_pods17,
        address = {New York, NY, USA},
        series = {{PODS} '17},
        title = {{Counting and Enumerating (Preferred) Database Repairs}},
        url = {https://dl.acm.org/doi/10.1145/3034786.3056107},
        doi = {10.1145/3034786.3056107},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Livshits, Ester and Kimelfeld, Benny},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

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