Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2506.14630

Help | Advanced Search

Computer Science > Distributed, Parallel, and Cluster Computing

arXiv:2506.14630 (cs)
[Submitted on 18 Jun 2025 ]

Title: Keigo: Co-designing Log-Structured Merge Key-Value Stores with a Non-Volatile, Concurrency-aware Storage Hierarchy (Extended Version)

Title: 北广吾:与非易失性、并发感知的存储层次结构协同设计日志结构合并键值存储(扩展版本)

Authors:Rúben Adão, Zhongjie Wu, Changjun Zhou, Oana Balmau, João Paulo, Ricardo Macedo
Abstract: We present Keigo, a concurrency- and workload-aware storage middleware that enhances the performance of log-structured merge key-value stores (LSM KVS) when they are deployed on a hierarchy of storage devices. The key observation behind Keigo is that there is no one-size-fits-all placement of data across the storage hierarchy that optimizes for all workloads. Hence, to leverage the benefits of combining different storage devices, Keigo places files across different devices based on their parallelism, I/O bandwidth, and capacity. We introduce three techniques - concurrency-aware data placement, persistent read-only caching, and context-based I/O differentiation. Keigo is portable across different LSMs, is adaptable to dynamic workloads, and does not require extensive profiling. Our system enables established production KVS such as RocksDB, LevelDB, and Speedb to benefit from heterogeneous storage setups. We evaluate Keigo using synthetic and realistic workloads, showing that it improves the throughput of production-grade LSMs up to 4x for write- and 18x for read-heavy workloads when compared to general-purpose storage systems and specialized LSM KVS.
Abstract: 我们提出了Keigo,这是一种具备并发和工作负载感知能力的存储中间件,当部署在存储设备层次结构上时,它可以提升日志结构合并键值存储(LSM KVS)的性能。 Keigo背后的关键观察是,在存储层次结构中不存在一种能够适用于所有工作负载的“一刀切”的数据放置方式。 因此,为了利用结合不同存储设备的优势,Keigo根据文件的并行性、I/O带宽和容量,在不同的设备之间放置文件。 我们引入了三种技术——并发感知的数据放置、持久只读缓存和基于上下文的I/O区分。 Keigo可以跨不同的LSM移植,能够适应动态工作负载,并且不需要广泛的配置分析。 我们的系统使已有的生产级KVS(如RocksDB、LevelDB和Speedb)能够从异构存储设置中受益。 我们使用合成和实际工作负载对Keigo进行了评估,结果显示,与通用存储系统和专门的LSM KVS相比,对于写密集型工作负载,Keigo可将生产级LSM的吞吐量提高多达4倍;对于读密集型工作负载,可提高多达18倍。
Comments: This is an extended version of the full paper to appear in VLDB 2025
Subjects: Distributed, Parallel, and Cluster Computing (cs.DC) ; Databases (cs.DB)
Cite as: arXiv:2506.14630 [cs.DC]
  (or arXiv:2506.14630v1 [cs.DC] for this version)
  https://doi.org/10.48550/arXiv.2506.14630
arXiv-issued DOI via DataCite

Submission history

From: Ricardo Macedo [view email]
[v1] Wed, 18 Jun 2025 00:52:15 UTC (598 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.DC
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs
cs.DB

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号