• Corpus ID: 211678127

VAT: Asymptotic Cost Analysis for Multi-Level Key-Value Stores

@article{Batsaras2020VATAC,
  title={VAT: Asymptotic Cost Analysis for Multi-Level Key-Value Stores},
  author={Nikos Batsaras and Giorgos Saloustros and Anastasios Papagiannis and Panagiota Fatourou and Angelos Bilas},
  journal={ArXiv},
  year={2020},
  volume={abs/2003.00103}
}
Over the past years, there has been an increasing number of key-value (KV) store designs, each optimizing for a different set of requirements. Furthermore, with the advancements of storage technology the design space of KV stores has become even more complex. More recent KV-store designs target fast storage devices, such as SSDs and NVM. Most of these designs aim to reduce amplification during data reorganization by taking advantage of device characteristics. However, until today most analysis… 
Using RDMA for Efficient Index Replication in LSM Key-Value Stores
TLDR
Talos is designed and implemented, an efficient rack-scale LSM-based KV store that aims to significantly reduce the I/O amplification and CPU overhead in backup nodes and make replication in the KV Store practical, and enables KV stores to operate with larger growth factors to reduce space amplification without sacrificing precious CPU cycles.
An Efficient Memory-Mapped Key-Value Store for Flash Storage
TLDR
Kreon is a key-value store that targets servers with flash-based storage, where CPU overhead and I/O amplification are more significant bottlenecks compared to I/o randomness and Kreon performs data movement from level to level by performing partial instead of full data reorganization via the use of a full index per-level.
Toward a Better Understanding and Evaluation of Tree Structures on Flash SSDs
TLDR
This paper identifies seven benchmarking pitfalls that can lead to incorrect measurements of key performance indicators, hinder the reproducibility and the representativeness of the results, and lead to suboptimal deployments in production environments and provides guidelines on how to avoid these pitfalls.
Parallax: Hybrid Key-Value Placement in LSM-based Key-Value Stores
TLDR
This paper designs and implements Parallax, which proposes hybrid KV placement to reduce GC overhead significantly and increases the benefits of using a log, and assesses it against RocksDB that places all values in place and BlobDB that always performs KV separation.

References

SHOWING 1-10 OF 33 REFERENCES
Tucana: Design and Implementation of a Fast and Efficient Scale-up Key-value Store
TLDR
Tucana is presented, a feature-rich key-value store that achieves low CPU overhead that is designed from a Be-tree approach to maintain asymptotic properties for inserts and uses three techniques to reduce overheads: copy-on-write, private allocation, and direct device management.
SifrDB: A Unified Solution for Write-Optimized Key-Value Stores in Large Datacenter
TLDR
This work designs a highly efficient parallel search algorithm that fully exploits the access parallelism of modern flash-based storage devices to substantially boost the read performance and builds a KV store on a novel split MS-forest structure, called SifrDB.
An Efficient Memory-Mapped Key-Value Store for Flash Storage
TLDR
Kreon is a key-value store that targets servers with flash-based storage, where CPU overhead and I/O amplification are more significant bottlenecks compared to I/o randomness and Kreon performs data movement from level to level by performing partial instead of full data reorganization via the use of a full index per-level.
Towards Accurate and Fast Evaluation of Multi-Stage Log-structured Designs
TLDR
A new analytic primitives and MSLS design models that can almost perfectly estimate the cost of inserts in LevelDB, whereas the conventional worst-case analysis gives 1.8- 3.5× higher estimates than the actual cost.
Monkey: Optimal Navigable Key-Value Store
TLDR
Monkey, an LSM-based key-value store that strikes the optimal balance between the costs of updates and lookups with any given main memory budget is presented, and how to use this model to answer what-if design questions about how changes in environmental parameters impact performance is shown.
An efficient design and implementation of LSM-tree based key-value store on open-channel SSD
TLDR
LevelDB is extended to explicitly leverage the multiple channels of an SSD to exploit its abundant parallelism and the throughput of storage system can be improved by more than 4X after applying all proposed optimization techniques.
Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging
TLDR
Dostoevsky is designed, a key-value store that navigates the entire Fluid LSM-tree design space based on the application workload and hardware to maximize throughput using a novel closed-form performance model.
LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items
TLDR
LSM-trie is proposed, a KV storage system that substantially reduces metadata for locating KV items, reduces write amplification by an order of magnitude, and needs only two disk accesses with each KV read even when only less than 10% of metadata (Bloom filters) can be held in memory.
Enabling Efficient Updates in KV Storage via Hashing
TLDR
This work proposes HashKV, which aims for high update performance atop KV separation under update-intensive workloads and uses hash-based data grouping, which deterministically maps values to storage space to make both updates and GC efficient.
Mutant: Balancing Storage Cost and Latency in LSM-Tree Data Stores
TLDR
Mutant is a new storage layer for log-structured merge tree (LSM-tree) data stores that dynamically balances database cost and performance by organizing SSTables (files that store a subset of records) into different storage types based on SSTable access frequencies.
...
1
2
3
4
...