Fast Scans on Key-Value Stores
Summary: TellStore, a distributed KVS, enables fast scans for analytics while keeping elastic get/put performance. Near state-of-the-art transactional throughput, with orders-of-magnitude gains on analytics/mixed workloads, validated on YCSB and telecom benchmarks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Markus Pilman
- 2. Kevin Bocksrocker
- 3. Lucas Braun
- 4. Renato Marroquín
- 5. Donald Kossmann
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,311 | Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging | 2018 | SIGMOD | 0.00012657439 |
| 2,109 | The Log-Structured Merge-Bush & the Wacky Continuum | 2019 | SIGMOD | 9.5318694e-05 |
| 3,488 | Optimal Column Layout for Hybrid Workloads | 2019 | VLDB | 7.0479329e-05 |
| 4,903 | Persistent Memory Hash Indexes: An Experimental Evaluation | 2021 | VLDB | 5.8399968e-05 |
| 5,512 | Strong consistency is not hard to get: Two-Phase Locking and Two-Phase Commit on Thousands of Cores | 2019 | VLDB | 5.4665318e-05 |
| 7,995 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB | 4.6109825e-05 |
| 8,788 | FishStore: Faster Ingestion with Subset Hashing | 2019 | SIGMOD | 4.451039e-05 |
| 11,530 | The End of Moore’s Law and the Rise of The Data Processor | 2021 | VLDB | 4.1945683e-05 |
| 11,672 | Block as a Value for SQL over NoSQL | 2019 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 23 of 23 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next