EvenDB: Optimizing key-value storage for spatial locality

16Citations
Citations of this article
41Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Applications of key-value (KV-)storage often exhibit high spatial locality, such as when many data items have identical composite key prefixes. This prevalent access pattern is underused by the ubiquitous LSM design underlying high-Throughput KV-stores today. We present EvenDB, a general-purpose persistent KV-store optimized for spatially-local workloads. EvenDB combines spatial data partitioning with LSM-like batch I/O. It achieves high throughput, ensures consistency under multi-Threaded access, and reduces write amplification. In experiments with real-world data from a large analytics platform, EvenDB outperforms the state-of-The-Art. E.g., on a 256GB production dataset, EvenDB ingests data 4.4X faster than RocksDB and reduces write amplification by nearly 4X. In traditional YCSB workloads lacking spatial locality, EvenDB is on par with RocksDB and significantly better than other open-source solutions we explored.

Cite

CITATION STYLE

APA

Gilad, E., Bortnikov, E., Braginsky, A., Gottesman, Y., Hillel, E., Keidar, I., … Shahout, R. (2020). EvenDB: Optimizing key-value storage for spatial locality. In Proceedings of the 15th European Conference on Computer Systems, EuroSys 2020. Association for Computing Machinery, Inc. https://doi.org/10.1145/3342195.3387523

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free