Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams
Summary: Ada-Sketches provide temporally-aware frequency summaries in fixed memory, overcoming Hokusai's growth and discontinuities. Inspired by Dolby noise reduction, they generalize classic sketches with time-adaptive error guarantees and improve point- and range-query accuracy on real streams. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Anshumali Shrivastava (Rice University)
- 2. Arnd Christian König (Microsoft)
- 3. Mikhail Bilenko (Microsoft)
BibTeX Citation
@inproceedings{shrivastava_sigmod16,
title = {{Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams}},
author = {Shrivastava, Anshumali and König, Arnd Christian and Bilenko, Mikhail},
series = {{SIGMOD} '16},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2882903.2882946},
url = {https://dl.acm.org/doi/10.1145/2882903.2882946},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,930 | Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation | 2018 | SIGMOD | 7.8415815e-05 |
| 3,980 | BurstSketch: Finding Bursts in Data Streams | 2021 | SIGMOD | 6.8788724e-05 |
| 6,816 | Out of Many We are One: Measuring Item Batch with Clock-Sketch | 2021 | SIGMOD | 5.6731874e-05 |
| 7,873 | Double-Anonymous Sketch: Achieving Top-K-fairness for Finding Global Top-K Frequent Items | 2023 | SIGMOD | 5.4357887e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 26 | Models and Issues in Data Stream Systems | 2002 | PODS | 0.00052121228 |
| 124 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00030600691 |
| 312 | Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries | 2001 | VLDB | 0.00021311793 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,501 | Sketch-based Secure Query Processing for Streaming Data | 2026 | SIGMOD |
| 2 | 4,979 | Pyramid Sketch: a Sketch Framework for Frequency Estimation of Data Streams | 2017 | VLDB |
| 3 | 11,538 | A Universal Sketch for Estimating Heavy Hitters and Per-Element Frequency Moments in Data Streams with Bounded Deletions | 2024 | SIGMOD |
| 4 | 2,930 | Data Sketches for Disaggregated Subset Sum and Frequent Item Estimation | 2018 | SIGMOD |
| 5 | 7,870 | Sketch-based Querying of Distributed Sliding-Window Data Streams | 2012 | VLDB |
| 6 | 842 | Processing Complex Aggregate Queries over Data Streams | 2002 | SIGMOD |
| 7 | 10,534 | SieveSketch: A Fine-grained and Adaptive Sketch Framework for Accurate Frequency Estimation | 2026 | SIGMOD |
| 8 | 312 | Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries | 2001 | VLDB |
| 9 | 11,812 | Bayesian Sketches for Volume Estimation in Data Streams | 2023 | VLDB |
| 10 | 1,319 | Augmented Sketch: Faster and More Accurate Stream Processing | 2016 | SIGMOD |