A dual-objective learned index for LSM trees co-optimizes block partitioning and lookup error, with an RL agent tuning parameters, and reports 1.19-2.21x throughput gains in RocksDB.
Bourbon Code
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees
A dual-objective learned index for LSM trees co-optimizes block partitioning and lookup error, with an RL agent tuning parameters, and reports 1.19-2.21x throughput gains in RocksDB.