shunzi

SOSP’11 SILT: A Memory-Efficient, High-Performance Key-Value Store

ICDE’24 LSM-tree related paper

FluidKV: Seamlessly Bridging the Gap between Indexing Performance and Memory-Footprint on Ultra-Fast Storage

ICDE’23/VLDBJ’24 Optimizing LSM-based indexes for disaggregated memory

HotStorage’24 Can Modern LLMs Tune and Configure LSM-based Key-Value Stores?

SIGMOD’19 FITing-Tree

SIGMOD’18 Learned Index

ATC’23 Calcspar

FAST’23 ADOC

ATC’19 SILK/TOCS’20 SILK+

ATC’18 HashKV

ICDE’20 TKDE’22 UniKV

CIDR’2023 2Tree

内存分段

地址空间和地址转换

进程调度策略

运行机制 Mechanism - 底层方法和协议

Processes and API

OSTEP Introduction

MSST’20 NovKV

HotStorage 2019 - Jungle

Writing Habbits

LSbM-tree

AC-Key

Research Tips

ListDB

EuroSys’22 p2KVS

Cache Replacement Policies

INFINIFS

FAST21 REMIX

LevelDB LRUCache

ChameleonDB

MatrixKV

About


ICDE‘2024 LSM-tree 相关论文选读。

HotStorage’24 Best Paper 介绍了一种利用 LLM 调优 LSM 的思路

FITing-Tree: A Data-aware Index Structure

Tim Krasa 等人在 17，18 年率先提出的学习索引，表明其相比于传统索引有巨大的优势

ATC’23 Calcspar: A Contract-Aware LSM Store for Cloud Storage with Low Latency Spikes

FAST’23 ADOC: Automatically Harmonizing Dataflow Between Components in Log-Structured Key-Value Stores for Improved Performance

ATC’19 SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores

ATC18/TOS19: HashKV: Enabling Efficient Updates in KV Storage via Hashing

ICDE20/TKDE22: UniKV: Toward High-Performance and Scalable KV Storage in Mixed Workloads via Unified Indexing

CIDR’2023 Two is Better Than One: The Case for 2-Tree for Skewed Data Sets

威斯康辛州大学操作系统书籍《Operating Systems: Three Easy Pieces》读书笔记系列之 Virtualization（虚拟化）。本篇为虚拟化技术的基础篇系列第五篇（Memory Virtualization），内存虚拟化。内存虚拟化又将分为两篇，本篇为第二篇内存虚拟化之基础 - 内存分段和空闲空间管理

威斯康辛州大学操作系统书籍《Operating Systems: Three Easy Pieces》读书笔记系列之 Virtualization（虚拟化）。本篇为虚拟化技术的基础篇系列第四篇（Memory Virtualization），内存虚拟化。内存虚拟化又将分为两篇，本篇为第一篇内存虚拟化之基础 - 地址空间和地址转换

本篇为虚拟化技术的基础篇系列第三篇（Mechanism and Policy），机制和策略。（结合第一篇给出的虚拟化两层实现）CPU 虚拟化被分为两篇，此篇是第二篇，Policy

本篇为虚拟化技术的基础篇系列第二篇（Mechanism and Policy），机制和策略。（结合第一篇给出的虚拟化两层实现）CPU 虚拟化被分为两篇，此篇是第一篇，Mechanism

OSTEP 虚拟化第一部分：CPU 虚拟化之进程和 进程API

MSST’2020 NovKV: Efficient Garbage Collection for Key-Value Separated LSM-Stores

HotStorage 2019 - Jungle: Towards Dynamically Adjustable Key-Value Store by Combining LSM-Tree and Copy-On-Write B+-Tree

The Most Common Habits from more than 200 English Papers written by Graduate Chinese Engineering Students

Re-enabling Buffer Caching in Data Management for Mixed Reads and Writes

ATC’20 AC-Key: Adaptive Caching for LSM-based Key-Value Stores

OSDI’22 ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory

FAST21 REMIX: Efficient Range Query for LSM-trees

EuroSys2021 - ChameleonDB: a Key-value Store for Optane Persistent Memory

MatrixKV: Reducing Write Stalls and Write Amplification in LSM-tree Based KV Stores with Matrix Container in NVM