DBScholar

Back to papers

A Dichotomy in the Complexity of Deletion Propagation with Functional Dependencies

Summary: Establishes a complexity dichotomy for deletion propagation under functional dependencies for self‑join‑free conjunctive views: a simple structural condition yields a polynomial‑time algorithm (similar to Buneman et al.). If violated, the problem is NP‑hard, constant‑factor inapproximable and deciding existence of a side‑effect‑free solution is NP‑complete, thereby generalizing prior results of Kimelfeld et al. and Cong et al. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1576
Venue
PODS
Year
2012
Pagerank
6.0461963e-05
Overall Rank
5,905 | 59.49%
DOI
10.1145/2213556.2213584

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kimelfeld_pods12,
        address = {New York, NY, USA},
        series = {{PODS} '12},
        title = {{A Dichotomy in the Complexity of Deletion Propagation with Functional Dependencies}},
        url = {https://dl.acm.org/doi/10.1145/2213556.2213584},
        doi = {10.1145/2213556.2213584},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kimelfeld, Benny},
        year = {2012}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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