At-the-time and Back-in-time Persistent Sketches
Summary: Proposes ATTP and BITP sketches to answer historical queries with far smaller space. Presents multiple implementations and shows superior empirical efficiency over state-of-the-art historical-query methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Benwei Shi (University of Utah)
- 2. Zhuoyue Zhao (University of Utah)
- 3. Yanqing Peng (University of Utah)
- 4. Feifei Li (University of Utah)
- 5. Jeff M. Phillips (University of Utah)
BibTeX Citation
@inproceedings{shi_sigmod21,
title = {{At-the-time and Back-in-time Persistent Sketches}},
author = {Shi, Benwei and Zhao, Zhuoyue and Peng, Yanqing and Li, Feifei and Phillips, Jeff M.},
series = {{SIGMOD} '21},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3448016.3452802},
url = {https://dl.acm.org/doi/10.1145/3448016.3452802},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,498 | Stingy Sketch: A Sketch Framework for Accurate and Fast Frequency Estimation | 2022 | VLDB | 5.6031077e-05 |
| 7,716 | Double-Anonymous Sketch: Achieving Top-K-fairness for Finding Global Top-K Frequent Items | 2023 | SIGMOD | 5.5605526e-05 |
| 8,310 | TreeSensing: Linearly Compressing Sketches with Flexibility | 2023 | SIGMOD | 5.4556836e-05 |
| 9,374 | Optimal Matrix Sketching over Sliding Windows | 2024 | VLDB | 5.2755515e-05 |
| 9,556 | CAFE: Towards Compact, Adaptive, and Fast Embedding for Large-scale Recommendation Models | 2024 | SIGMOD | 5.2528121e-05 |
| 10,212 | Concurrent Path-Copying Update to Tree Structures | 2026 | SIGMOD | 5.093636e-05 |
| 10,427 | AeroSketch: Near-Optimal Time Matrix Sketch Framework for Persistent, Sliding Window, and Distributed Streams | 2026 | SIGMOD | 5.093636e-05 |
| 10,824 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 29 of 29 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,110 | PR-Sketch: Monitoring Per-key Aggregation of Streaming Data with Nearly Full Accuracy | 2021 | VLDB |
| 2 | 10,371 | Focus! Fast On-disk Concurrency-control Using Sketches | 2026 | SIGMOD |
| 3 | 3,145 | Fully Persistent B+-trees | 1991 | SIGMOD |
| 4 | 11,954 | Durable Top-k Queries on Temporal Data | 2018 | VLDB |
| 5 | 6,547 | Optimal Splitters for Temporal and Multi-version Databases | 2013 | SIGMOD |
| 6 | 10,824 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB |
| 7 | 10,289 | Sketch-based Secure Query Processing for Streaming Data | 2026 | SIGMOD |
| 8 | 12,025 | Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries | 2016 | PODS |
| 9 | 7,036 | On-Off Sketch: A Fast and Accurate Sketch on Persistence | 2021 | VLDB |
| 10 | 3,023 | Persistent Data Sketching | 2015 | SIGMOD |