"tree data structures"

UniKV: Toward High-Performance and Scalable KV Storage in Mixed Workloads via Unified Indexing

Persistent key-value (KV) stores are mainly designed based on the Log-Structured Merge-tree (LSM-tree), which suffer from large read and write amplifications, especially when KV stores grow in size. Existing design optimizations for LSM-tree-based KV …

Leveraging Array Mapped Tries in KSM for Lightweight Memory Deduplication

In cloud computing, how to use limited hardware resources to meet the increasing demands has become a major issue. KSM (Kernel Same-page Merging) is a content-based page sharing mechanism used in Linux that merges equal memory pages, thereby …

FlameDB: A Key-Value Store With Grouped Level Structure and Heterogeneous Bloom Filter

Key-value (KV) stores are widely used to provide much higher read and write throughput than traditional SQL databases. In particular, LSM-tree based KV store is popular with many applications since it could eliminate random writes and thus provides …