CAMAL: Optimizing LSM-trees via Active Learning

Weiping Yu, Siqiang Luo, Zihao Yu, Gao Cong
9/23/2024
cs.DBcs.AIcs.LG

No official code found. Best implementation: NTU-Siqiang-Group/CAMAL (5 stars, GPL-3.0, last commit 2024-04-06).

Abstract

We use machine learning to optimize LSM-tree structure, aiming to reduce the cost of processing various read/write operations. We introduce a new approach Camal, which boasts the following features: (1) ML-Aided: Camal is the first attempt to apply active learning to tune LSM-tree based key-value stores. The learning process is coupled with traditional cost models to improve the training process; (2) Decoupled Active Learning: backed by rigorous analysis, Camal adopts active learning paradigm based on a decoupled tuning of each parameter, which further accelerates the learning process; (3) Easy Extrapolation: Camal adopts an effective mechanism to incrementally update the model with the growth of the data size; (4) Dynamic Mode: Camal is able to tune LSM-tree online under dynamically changing workloads; (5) Significant System Improvement: By integrating Camal into a full system RocksDB, the system performance improves by 28% on average and up to 8x compared to a state-of-the-art RocksDB design.

View on arXivView PDF

Code Implementations(1)

GPL-3.0
52C++, CMakeMar 27, 20232 years agoGPL-3.0

Similar Papers

Cite this paper

@article{yu2024camal,
  title  = {CAMAL: Optimizing LSM-trees via Active Learning},
  author = {Weiping Yu and Siqiang Luo and Zihao Yu and Gao Cong},
  year   = {2024},
  eprint = {2409.15130},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.15130v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.15130.svg)](https://codeofpaper.com/paper/2409.15130)

Discussion