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 article shows how to use full-path indexing in a file system to realize fast directory scans, writes, and renames. The article introduces a range-rename mechanism for efficient key-space changes in a write-optimized dictionary. This mechanism is encapsulated in the key-value Application Programming Interface (API) and simplifies the overall file system design.
We implemented this mechanism in B&egr;-trees File System (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, Extents File System (XFS), and Z File System (ZFS), across a variety of workloads.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3241061 | TOS |
Keywords | Field | DocType |
B ε -trees, file system, write optimization | File system,Computer science,Directory,Parallel computing,ext4,Search engine indexing,Application programming interface,Indexed file,File system design,Recursion | Journal |
Volume | Issue | ISSN |
14 | 3 | 1553-3077 |
Citations | PageRank | References |
0 | 0.34 | 39 |
Authors | ||
10 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yang Zhan | 1 | 65 | 6.65 |
| Yizheng Jiao | 2 | 62 | 4.94 |
| Donald E. Porter | 3 | 389 | 32.25 |
| Alex Conway | 4 | 1 | 3.39 |
| Eric Knorr | 5 | 3 | 2.40 |
| Martín Farach-Colton | 6 | 140 | 9.48 |
| Michael A. Bender | 7 | 2144 | 138.24 |
| Jun Yuan | 8 | 52 | 6.08 |
| William Jannen | 9 | 64 | 7.48 |
| Rob Johnson | 10 | 562 | 39.43 |