Database Paper Browser

Back to papers

Sampling Time-Based Sliding Windows in Bounded Space

Summary: Sampling time-based sliding windows in bounded space; uniform sampling can't guarantee a minimum sample size, so bounded priority sampling (BPS) bounds space and adapts to data rate, with a lower bound on expected size. Stratified sampling via merge-based stratification (MBS) keeps strata roughly equal for even window coverage; feasibility study on large real-world data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4003
Venue
SIGMOD
Year
2008
Pagerank
7.9671512e-05
Overall Rank
2,881 | 79.98%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Rank Citing Paper Year Venue Pagerank
2,068 Optimal Sampling From Distributed Streams 2010 PODS 9.638573e-05
2,807 Optimal Sampling from Sliding Windows 2009 PODS 8.096649e-05
3,067 Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges 2021 SIGMOD 7.6247945e-05
4,716 Weighted Reservoir Sampling from Distributed Streams 2019 PODS 5.9692227e-05
6,775 Matrix Sketching Over Sliding Windows 2016 SIGMOD 4.9252038e-05
9,632 External Memory Stream Sampling 2015 PODS 4.3093476e-05
9,961 Adaptive threshold sampling 2022 SIGMOD 4.2254157e-05
10,594 GREAT: Generalized Reservoir Sampling based Triangle Counting Estimation over Streaming Graphs 2025 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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