Database Paper Browser

Back to papers

Stochastic Submodular Data Forgetting

Summary: Subset-selection data forgetting: given relational D, query log Q and budget B, pick D* (|D*|≤B) to preserve approximate expected query answers. IndepDF and DepDF avoid function evaluations to get submodular-style guarantees with amnesia-like runtime, matching submodular accuracy while scaling. (summarized by gpt-5-mini on Feb 11 2026)

Paper ID
7426
Venue
SIGMOD
Year
2026
Pagerank
4.1945683e-05
Overall Rank
10,116 | 29.63%
DOI
10.1145/3769830

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
158 Automated Selection of Materialized Views and Indexes for SQL Databases 2000 VLDB 0.00040071492
449 Approximate Query Processing: Taming the TeraBytes! A Tutorial 2001 VLDB 0.00022846068
1,021 Materialized View Selection for Multidimensional Datasets* 1998 VLDB 0.00014619259
1,112 Materialized View Selection and Maintenance Using Multi-Query Optimization 2001 SIGMOD 0.00013917776
1,574 Approximate Query Processing: No Silver Bullet 2017 SIGMOD 0.00011287495
3,074 On the Complexity of the View-Selection Problem 1999 PODS 7.6110034e-05
6,178 A Database System with Amnesia 2017 CIDR 5.1692384e-05
6,649 Big Data Space Fungus 2015 CIDR 4.9768878e-05
7,452 PHOcus: Efficiently Archiving Photos 2022 VLDB 4.7263711e-05
Previous Page 1 / 1 Next

Semantically Similar Papers