Database Paper Browser

Back to papers

Maximizing Conjunctive Views in Deletion Propagation

Summary: Dichotomy for deletion-propagation on conjunctive views without self-joins: each CQ is either solved optimally by the trivial algorithm or is APX-hard (exactly those where the trivial fails). Two constant-factor approximations for star CQs—a greedy and an LP randomized-rounding (better ratio, extensible); self-joins severely degrade approximability. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1549
Venue
PODS
Year
2011
Pagerank
5.7938195e-05
Overall Rank
4,971 | 65.42%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

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