This paper presents SwapKV, which strives to retain both the advantages of DRAM and PMEM, aiming to achieve both high performance and large capacity simultaneously.

We present RStore to enable low and predictable latency (i.e. low tail latency) and efficient use of hardware resources such as CPU, memory and storage through the following design points:

• Asynchronous execution
• Hybrid DRAM+NVM architecture
• Log-structured storage
• User-space networking

Introduce two key techniques of distributed file system.

We present a novel scheme, called Log-assisted LSM-tree (L2SM), which adopts a small-size, multi-level log structure to isolate selected key-value items that have a disruptive effect on the tree structure, accumulates and absorbs the repeated updates in a highly efficient manner, and removes obsolete and deleted key-value items at an early stage.

How to analyse the source codes of snappy ? In this blog, the pseudocode of compression and uncompression using snappy is given, which is aimed to help you understand snappy algorithm.

Start from a new Ubuntu OS.

  RocksDB的Compaction过程整体可分为三个部分，prepare keys、process keys、write keys。

MySQL存储引擎InnoDB的buffer pool设计思路。