RFS: An LSM-Tree-Based File System for Enhanced Microdata Performance

Lixin WANG
Yutong LU

IEICE TRANSACTIONS on Information and Systems   Vol.E99-D    No.12    pp.3035-3046
Publication Date: 2016/12/01
Publicized: 2016/09/06
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2015EDP7470
Type of Manuscript: PAPER
Category: Fundamentals of Information Systems
local file systems,  log-structured merge tree,  microdata,  namespace partitioning,  write-ordered write-optimized store,  

Full Text: PDF>>
Buy this Article

File system workloads are increasing write-heavy. The growing capacity of RAM in modern nodes allows many reads to be satisfied from memory while writes must be persisted to disk. Today's sophisticated local file systems like Ext4, XFS and Btrfs optimize for reads but suffer from workloads dominated by microdata (including metadata and tiny files). In this paper we present an LSM-tree-based file system, RFS, which aims to take advantages of the write optimization of LSM-tree to provide enhanced microdata performance, while offering matching performance for large files. RFS incrementally partitions the namespace into several metadata columns on a per-directory basis, preserving disk locality for directories and reducing the write amplification of LSM-trees. A write-ordered log-structured layout is used to store small files efficiently, rather than embedding the contents of small files into inodes. We also propose an optimization of global bloom filters for efficient point lookups. Experiments show our library version of RFS can handle microwrite-intensive workloads 2-10 times faster than existing solutions such as Ext4, Btrfs and XFS.