DBScholar

Back to papers

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
1795
Venue
PODS
Year
2019
Pagerank
5.5422948e-05
Overall Rank
7,797 | 46.51%
DOI
10.1145/3294052.3319701

Incoming Non-self Citations Over Time

Authors

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,691 On Reporting Durable Patterns in Temporal Proximity Graphs 2024 PODS 5.3839057e-05
Previous Page 1 / 1 Next

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
691 Approximate Counts and Quantiles over Sliding Windows 2004 PODS 0.00014927798
1,146 Graph Sketches: Sparsification, Spanners, and Subgraphs 2012 PODS 0.00011984702
2,218 Maintaining Variance and k–Medians over Data Stream Windows 2003 PODS 8.9331834e-05
2,576 Optimal Sampling from Sliding Windows 2009 PODS 8.3964437e-05
2,808 A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows 2006 PODS 8.1006881e-05
2,959 Composable Core-sets for Diversity and Coverage Maximization 2014 PODS 7.9182968e-05
3,989 Real-Time Influence Maximization on Dynamic Social Streams 2017 VLDB 6.9716774e-05
5,847 MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension 2017 VLDB 6.0676282e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

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