A flexible and dynamic partition storage scheme based on key-value separation
Chao Zhou, Xu Ge · 2024
In the field of key-value storage performance optimization, WiscKey has enhanced the write performance of key-value storage engines based on the Log-Structured Merge-tree (LSM-Tree) by introducing the concept of key-value separation, achieving significant progress in performance optimization of key-value storage systems. Building on this design concept, this paper proposes a new flexible and dynamic partition storage scheme based on key-value separation, named FlexiKV, aimed at optimizing range query performance in key-value separation systems. FlexiKV introduces dynamic value log partitioning and designs a comprehensive scoring mechanism based on access frequency and the number of key-value pairs, achieving effective data organization and storage. The scheme dynamically adjusts partitioning strategies to achieve a balanced distribution of data load and improves the efficiency of range queries in scenarios of data load skew.