Concerto: A high concurrency key-value store with integrity

A Arasu, K Eguro, R Kaushik, D Kossmann… - Proceedings of the …, 2017 - dl.acm.org
A Arasu, K Eguro, R Kaushik, D Kossmann, P Meng, V Pandey, R Ramamurthy
Proceedings of the 2017 ACM International Conference on Management of Data, 2017dl.acm.org
Verifying the integrity of outsourced data is a classic, well-studied problem. However current
techniques have fundamental performance and concurrency limitations for update-heavy
workloads. In this paper, we investigate the potential advantages of deferred and batched
verification rather than the per-operation verification used in prior work. We present
Concerto, a comprehensive key-value store designed around this idea. Using Concerto, we
argue that deferred verification preserves the utility of online verification and improves …
Verifying the integrity of outsourced data is a classic, well-studied problem. However current techniques have fundamental performance and concurrency limitations for update-heavy workloads. In this paper, we investigate the potential advantages of deferred and batched verification rather than the per-operation verification used in prior work. We present Concerto, a comprehensive key-value store designed around this idea. Using Concerto, we argue that deferred verification preserves the utility of online verification and improves concurrency resulting in orders-of-magnitude performance improvement. On standard benchmarks, the performance of Concerto is within a factor of two when compared to state-of-the-art key-value stores without integrity.
ACM Digital Library
以上显示的是最相近的搜索结果。 查看全部搜索结果