Garnet: A Next-Generation Cache-Store for Accelerating Applications and Services
Summary: Garnet is a ground-up, Redis-protocol-compatible cache-store redesign spanning storage, networking, and clustering. It supports rich data types, transactions, durability, and thread/node scalability while delivering up to 100× throughput and 4× lower tail latency. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Badrish Chandramouli (Microsoft)
- 2. Vasileios Zois (Microsoft)
- 3. Ted Hart (Microsoft)
- 4. Tal Zaccai (Microsoft)
- 5. Lukas M. Maas (Microsoft)
- 6. Yoganand Rajasekaran (Microsoft)
- 7. Darren Gehring (Microsoft)
BibTeX Citation
@article{chandramouli_vldb26,
title = {{Garnet: A Next-Generation Cache-Store for Accelerating Applications and Services}},
author = {Chandramouli, Badrish and Zois, Vasileios and Hart, Ted and Zaccai, Tal and Maas, Lukas M. and Rajasekaran, Yoganand and Gehring, Darren},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {2},
pages = {224--237},
doi = {10.14778/3773749.3773760},
url = {https://doi.org/10.14778/3773749.3773760},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 133 | A Case for Redundant Arrays of Inexpensive Disks (RAID) | 1988 | SIGMOD | 0.00030370315 |
| 614 | Faster: A Concurrent Key-Value Store with In-Place Updates | 2018 | SIGMOD | 0.00015720975 |
| 1,368 | Dash: Scalable Hashing on Persistent Memory | 2020 | VLDB | 0.00011003184 |
| 4,993 | Key-Value Storage Engines | 2020 | SIGMOD | 6.4096682e-05 |
| 7,905 | Amazon MemoryDB: A Fast and Durable Memory-First Cloud Database | 2024 | SIGMOD | 5.5181056e-05 |
| 7,973 | Concurrent Prefix Recovery: Performing CPR on a Database | 2019 | SIGMOD | 5.5157734e-05 |
| 11,696 | Achieving High Throughput and Elasticity in a Larger-than-Memory Store | 2021 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,542 | Put an Elephant into a Fridge: Optimizing Cache Efficiency for In-memory Key-value Stores | 2020 | VLDB |
| 2 | 4,677 | Redy: Remote Dynamic Memory Cache | 2022 | VLDB |
| 3 | 3,761 | ScaleStore: A Fast and Cost-Efficient Storage Engine using DRAM, NVMe, and RDMA | 2022 | SIGMOD |
| 4 | 9,624 | RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries | 2025 | VLDB |
| 5 | 2,034 | Efficient Distributed Memory Management with RDMA and Caching | 2018 | VLDB |
| 6 | 3,305 | Cache Tables: Paving the Way for an Adaptive Database Cache | 2003 | VLDB |
| 7 | 614 | Faster: A Concurrent Key-Value Store with In-Place Updates | 2018 | SIGMOD |
| 8 | 4,993 | Key-Value Storage Engines | 2020 | SIGMOD |
| 9 | 7,717 | Asynchronous Prefix Recoverability for Fast Distributed Stores | 2021 | SIGMOD |
| 10 | 5,348 | Crystal: A Unified Cache Storage System for Analytical Databases | 2021 | VLDB |