Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3035918.3064030 | SIGMOD Conference |
Field | DocType | Citations |
Computer science,Concurrency,Search engine indexing,Merkle tree,Associative array,Concerto,Database,Performance improvement | Conference | 7 |
PageRank | References | Authors |
0.55 | 31 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arvind Arasu | 1 | 2475 | 141.59 |
| Ken Eguro | 2 | 195 | 15.97 |
| Raghav Kaushik | 3 | 1412 | 66.84 |
| Donald Kossmann | 4 | 6220 | 603.55 |
| Pingfan Meng | 5 | 8 | 0.95 |
| Vineet Pandey | 6 | 19 | 3.43 |
| Ravi Ramamurthy | 7 | 110 | 10.58 |