DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees
Not on the map. Why?
Abstract (arXiv)
In this paper, we introduce DobLIX, a dual-objective learned index specifically designed for Log-Structured Merge(LSM) tree-based key-value stores. Although traditional learned indexes focus exclusively on optimizing index lookups, they often overlook the impact of data access from storage, resulting in performance bottlenecks. DobLIX addresses this by incorporating a second objective, data access optimization, into the learned index training process. This dual-objective approach ensures that both index lookup efficiency and data access costs are minimized, leading to significant improvements in read performance while maintaining write efficiency in real-world LSM-tree systems. Additionally, DobLIX features a reinforcement learning agent that dynamically tunes the system parameters, allowing it to adapt to varying workloads in real-time. Experimental results using real-world datasets demonstrate that DobLIX reduces indexing overhead and improves throughput by 1.19 to 2.21 times compared to state-of-the-art methods within RocksDB, a widely used LSM-tree-based storage engine.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 23 of its 74 references that are in the map. First posted on arXiv 7 Feb 2025.
Builds on
23 of 74 references.
References · 23
- 2021Convex optimizationcited by 2,515
- 2017The Case for Learned Index Structurescited by 188
- 2019ALEX: An Updatable Adaptive Learned Indexcited by 43
- 2019HoloDetect: Few-Shot Learning for Error Detectioncited by 31
- 2020RadixSpline: A Single-Pass Learned Indexcited by 31
- 2018FITing-Tree: A Data-aware Index Structurecited by 30
- 2020Benchmarking Learned Indexescited by 27
- 2019The PGM-index: a multicriteria, compressed and learned approach to data indexingcited by 17
- 2021CARMI: A Cache-Aware Learned Index with a Cost-based Construction Algorithmcited by 8
- 2021APEX: A High-Performance Learned Index on Persistent Memorycited by 6
- 2021Bounding the Last Mile: Efficient Learned String Indexingcited by 6
- 2023Updatable Learned Indexes Meet Disk-Resident DBMS -- From Evaluations to Design Choicescited by 6
11 more
- 2023Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloadscited by 6
- 2020Approximate Denial Constraintscited by 5
- 2022Are Updatable Learned Indexes Ready?cited by 5
- 2021Endure: A Robust Tuning Paradigm for LSM Trees Under Workload Uncertaintycited by 4
- 2021The Case for Learned In-Memory Joinscited by 4
- 2019Approximate Inference in Structured Instances with Noisy Categorical Observationscited by 3
- 2020On sampling from data with duplicate recordscited by 3
- 2023Towards Flexibility and Robustness of LSM Treescited by 2
- 2024LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-Level CSRcited by 2
- 2024DumpKV: Learning based lifetime aware garbage collection for key value separation in LSM-treecited by 1
- 2024vLSM: Low tail latency and I/O amplification in LSM-based KV storescited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025AutoIndexer: A Reinforcement Learning-Enhanced Index Advisor Towards Scaling Workloads
- 2025A New Paradigm in Tuning Learned Indexes: A Reinforcement Learning Enhanced Approach
- 2024UpLIF: An Updatable Self-Tuning Learned Index Framework
- 2025StorageXTuner: An LLM Agent-Driven Automatic Tuning Framework for Heterogeneous Storage Systems
- 2026RELOAD: A Robust and Efficient Learned Query Optimizer for Database Systems
- 2025SPI: Query-Depth-Adaptive Indexing for Streaming RAG in Vector Databases
- 2024IA2: Leveraging Instance-Aware Index Advisor with Reinforcement Learning for Diverse Workloads
- 2026SkillBrew: Multi-Objective Curation of Skill Banks for LLM Agents