Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives

Summary: Introduces a general method for sliding-window streaming maximization that bypasses exponential/smooth-histogram limits to achieve sublinear space and update time. Instantiated for submodular, diversity and subadditive objectives with cardinality constraints, improving prior problem-specific bounds. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: hc615aa8f4b5e6f12
Venue: PODS
Year: 2019
Pagerank: 5.4183555e-05
Overall Rank: 7,957 | 46.51%
DOI: 10.1145/3294052.3319701

Incoming Non-self Citations Over Time

Authors

1. Michele Borassi (Google)
2. Alessandro Epasto (Google)
3. Silvio Lattanzi (Google)
4. Sergei Vassilvitskii (Google)
5. Morteza Zadimoghaddam (Google)

BibTeX Citation

@inproceedings{borassi_pods19,
        address = {New York, NY, USA},
        series = {{PODS} '19},
        title = {{Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives}},
        url = {https://dl.acm.org/doi/10.1145/3294052.3319701},
        doi = {10.1145/3294052.3319701},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Borassi, Michele and Epasto, Alessandro and Lattanzi, Silvio and Vassilvitskii, Sergei and Zadimoghaddam, Morteza},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,832	On Reporting Durable Patterns in Temporal Proximity Graphs	2024	PODS	5.2680847e-05

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
710	Approximate Counts and Quantiles over Sliding Windows	2004	PODS	0.00014608975
1,169	Graph Sketches: Sparsification, Spanners, and Subgraphs	2012	PODS	0.00011726145
2,260	Maintaining Variance and k–Medians over Data Stream Windows	2003	PODS	8.7353589e-05
2,624	Optimal Sampling from Sliding Windows	2009	PODS	8.2095532e-05
2,759	Composable Core-sets for Diversity and Coverage Maximization	2014	PODS	8.0503817e-05
2,875	A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows	2006	PODS	7.9193665e-05
4,054	Real-Time Influence Maximization on Dynamic Social Streams	2017	VLDB	6.8274063e-05
5,246	MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension	2017	VLDB	6.213078e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,875	A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows	2006	PODS
2	11,772	Out-of-Order Sliding-Window Aggregation with Efficient Bulk Evictions and Insertions	2023	VLDB
3	9,559	Optimal Matrix Sketching over Sliding Windows	2024	VLDB
4	12,197	Distinct Sampling on Streaming Data with Near-Duplicates	2018	PODS
5	5,246	MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension	2017	VLDB
6	2,260	Maintaining Variance and k–Medians over Data Stream Windows	2003	PODS
7	710	Approximate Counts and Quantiles over Sliding Windows	2004	PODS
8	12,919	Variance Estimation over Sliding Windows	2007	PODS
9	2,807	Sampling Time-Based Sliding Windows in Bounded Space	2008	SIGMOD
10	2,624	Optimal Sampling from Sliding Windows	2009	PODS