HotRAP: Hot Record Retention and Promotion for LSM-trees with Tiered Storage
<|reference_start|>HotRAP: Hot Record Retention and Promotion for LSM-trees with Tiered Storage: The multi-level design of Log-Structured Merge-trees (LSM-trees) naturally fits the tiered storage architecture: the upper levels (recently inserted/updated records) are kept in fast storage to guarantee performance while the lower levels (the majority of records) are placed in slower but cheaper storage to reduce cost. However, frequently accessed records may have been compacted and reside in slow storage, and existing algorithms are inefficient in promoting these ``hot'' records to fast storage, leading to compromised read performance. We present HotRAP, a key-value store based on RocksDB that can timely promote hot records individually from slow to fast storage and keep them in fast storage while they are hot. HotRAP uses an on-disk data structure (a specially-made LSM-tree) to track the hotness of keys and includes three pathways to ensure that hot records reach fast storage with short delays. Our experiments show that HotRAP outperforms state-of-the-art LSM-trees on tiered storage by up to 5.6$\times$ compared to the second best under read-only and read-write-balanced YCSB workloads with common access skew patterns, and by up to 2.0$\times$ compared to the second best under Twitter production workloads.<|reference_end|>
@article{qiu2024hotrap:,
    title={HotRAP: Hot Record Retention and Promotion for LSM-trees with Tiered
  Storage},
    author={Jiansheng Qiu, Fangzhou Yuan, Mingyu Gao, Huanchen Zhang},
    journal={arXiv preprint arXiv:2402.02070},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.02070},
    primaryClass={cs.DB}
}