Concerto: A High Concurrency Key-Value Store with Integrity
Summary: Concerto: a high-concurrency key-value store built on deferred and batched integrity verification. Defers verification to boost concurrency, preserving online integrity utility and delivering orders-of-magnitude update throughput; performance stays within 2x of integrity-free KV stores on standard benchmarks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Arvind Arasu (Microsoft)
- 2. Ken Eguro (Microsoft)
- 3. Raghav Kaushik (Microsoft)
- 4. Donald Kossmann (Microsoft)
- 5. Pingfan Meng (University of California San Diego)
- 6. Vineet Pandey (University of California San Diego)
- 7. Ravi Ramamurthy (Microsoft)
BibTeX Citation
@inproceedings{arasu_sigmod17,
title = {{Concerto: A High Concurrency Key-Value Store with Integrity}},
author = {Arasu, Arvind and Eguro, Ken and Kaushik, Raghav and Kossmann, Donald and Meng, Pingfan and Pandey, Vineet and Ramamurthy, Ravi},
series = {{SIGMOD} '17},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3035918.3064030},
url = {https://dl.acm.org/doi/10.1145/3035918.3064030},
year = {2017}
}Incoming Citations (Sorted by Pagerank)
Showing 19 of 19 citing papers.
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 437 | Dynamic Authenticated Index Structures for Outsourced Databases | 2006 | SIGMOD | 0.00018489863 |
| 617 | Verifying Completeness of Relational Query Results in Data Publishing | 2005 | SIGMOD | 0.00015711988 |
| 1,724 | CorrectDB: SQL Engine with Practical Query Authentication | 2013 | VLDB | 9.9199577e-05 |
| 4,887 | Scalable Verification for Outsourced Dynamic Databases | 2009 | VLDB | 6.4612265e-05 |
| 5,153 | Structural Signatures for Tree Data Structures | 2008 | VLDB | 6.3428063e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,973 | Concurrent Prefix Recovery: Performing CPR on a Database | 2019 | SIGMOD |
| 2 | 10,895 | Keigo: Co-designing Log-Structured Merge Key-Value Stores with a Non-Volatile, Concurrency-aware Storage Hierarchy | 2025 | VLDB |
| 3 | 172 | High-Performance Concurrency Control Mechanisms for Main-Memory Databases | 2012 | VLDB |
| 4 | 7,184 | Memory-Optimized Multi-Version Concurrency Control for Disk-Based Database Systems | 2022 | VLDB |
| 5 | 4,887 | Scalable Verification for Outsourced Dynamic Databases | 2009 | VLDB |
| 6 | 867 | Coordination Avoidance in Database Systems | 2015 | VLDB |
| 7 | 614 | Faster: A Concurrent Key-Value Store with In-Place Updates | 2018 | SIGMOD |
| 8 | 2,442 | Local Verification of Global Integrity Constraints in Distributed Databases | 1993 | SIGMOD |
| 9 | 586 | ConQuer: Efficient Management of Inconsistent Databases | 2005 | SIGMOD |
| 10 | 3,870 | FastVer: Making Data Integrity a Commodity | 2021 | SIGMOD |