Name
Abstract | ||
|---|---|---|
Full-path indexing can improve I/O efficiency for workloads that operate on data organized using traditional, hierarchical directories, because data is placed on persistent storage in scan order. Prior results indicate, however, that renames in a local file system with full-path indexing are prohibitively expensive.This paper shows how to use full-path indexing in a file system to realize fast directory scans, writes, and renames. The paper introduces a range-rename mechanism for efficient key-space changes in a write-optimized dictionary. This mechanism is encapsulated in the key-value API and simplifies the overall file system design.We implemented this mechanism in BetrFS, an in-kernel, local file system for Linux. This new version, BetrFS 0.4, performs recursive greps 1.5x faster and random writes 1.2x faster than BetrFS 0.3, but renames are competitive with indirection-based file systems for a range of sizes. BetrFS 0.4 outperforms BetrFS 0.3, as well as traditional file systems, such as ext4, XFS, and ZFS, across a variety of workloads. |
Year | Venue | Field |
|---|---|---|
2018 | PROCEEDINGS OF THE 16TH USENIX CONFERENCE ON FILE AND STORAGE TECHNOLOGIES | File system,Directory,Computer science,ext4,Parallel computing,Search engine indexing,File system design,Recursion |
DocType | Citations | PageRank |
Conference | 2 | 0.37 |
References | Authors | |
37 | 10 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yang Zhan | 1 | 65 | 6.65 |
| Alexander Conway | 2 | 11 | 2.22 |
| Yizheng Jiao | 3 | 62 | 4.94 |
| Eric Knorr | 4 | 3 | 2.40 |
| Michael A. Bender | 5 | 2144 | 138.24 |
| Martín Farach-Colton | 6 | 140 | 9.48 |
| William Jannen | 7 | 64 | 7.48 |
| Rob Johnson | 8 | 562 | 39.43 |
| Donald E. Porter | 9 | 24 | 2.11 |
| Jun Yuan | 10 | 52 | 6.08 |