On the Feasibility of Forgetting in Data Streams

Summary: Introduces the Right-to-be-Forgotten Data Streaming (RFDS) model where updates are + or forget, incrementing or resetting an element’s frequency to zero to capture data-erasure semantics. In alpha-RFDS (forget-bounded by alpha), provides F0 and F1 estimators with almost-tight space lower bounds and practical algorithms. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 1965
Venue: PODS
Year: 2024
Pagerank: 5.6435171e-05
Overall Rank: 7,328 | 49.73%
DOI: 10.1145/3651603

Incoming Non-self Citations Over Time

Authors

1. A. Pavan (Iowa State University)
2. Sourav Chakraborty (Indian Statistical Institute)
3. N. V. Vinodchandran (University of Nebraska-Lincoln)
4. Kuldeep S. Meel (University of Toronto)

BibTeX Citation

@inproceedings{pavan_pods24,
        address = {New York, NY, USA},
        series = {{PODS} '24},
        title = {{On the Feasibility of Forgetting in Data Streams}},
        url = {https://dl.acm.org/doi/10.1145/3651603},
        doi = {10.1145/3651603},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Pavan, A. and Chakraborty, Sourav and Vinodchandran, N. V. and Meel, Kuldeep S.},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,171	Unbiased Insights: Optimal Streaming Algorithms for l_p Sampling, the Forget Model, and Beyond	2026	PODS	5.093636e-05
10,646	Perfect Sampling in Turnstile Streams Beyond Small Moments	2025	PODS	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
482	An Optimal Algorithm for the Distinct Elements Problem	2010	PODS	0.00017772185
3,795	Is Min-Wise Hashing Optimal for Summarizing Set Intersection?	2014	PODS	7.1200458e-05
5,669	Data Streams with Bounded Deletions	2018	PODS	6.1278944e-05
11,640	Estimating the Size of Union of Sets in Streaming Models	2021	PODS	5.093636e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,034	Streaming Algorithms for Robust Distinct Elements	2016	SIGMOD
2	5,669	Data Streams with Bounded Deletions	2018	PODS
3	7,548	Local Differentially Private Heavy Hitter Detection in Data Streams with Bounded Memory	2024	SIGMOD
4	885	Finding Frequent Items in Data Streams	2008	VLDB
5	11,638	Frequent Elements with Witnesses in Data Streams	2021	PODS
6	10,759	Efficient and Accurate Differentially Private Cardinality Continual Releases	2025	SIGMOD
7	10,925	Meaningful Data Erasure in the Presence of Dependencies	2025	VLDB
8	10,171	Unbiased Insights: Optimal Streaming Algorithms for l_p Sampling, the Forget Model, and Beyond	2026	PODS
9	6,188	"Amnesia" - A Selection of Machine Learning Models That Can Forget User Data Very Fast	2020	CIDR
10	10,404	Stochastic Submodular Data Forgetting	2026	SIGMOD