Publications

Optimal Ball Recycling

Preprint

Optimal Hashing in External Memory

Preprint PDF

The Full Path to Full-Path Indexing

PDF Project

How to Fragment Your File System

PDF

File Systems Fated for Senescence? Nonsense, Says Science!

PDF Project

The I/O Complexity of Computing Prime Tables

PDF

Recent & Upcoming Talks

Optimal Hashing in External Memory
Jul 12, 2018 1:30 PM
File Systems Fated For Senescence? Nonsense, Says Science!
Sep 24, 2017 3:15 PM
File Systems Fated For Senescence? Nonsense, Says Science!
Feb 28, 2017 2:00 PM

Projects

BetrFS

The $B^\varepsilon$-tree File System, or BetrFS, is an in-kernel file system that uses $B^\varepsilon$ trees to organize on-disk storage. $B^\varepsilon$ trees are a write-optimized dictionary, and offer the same asymptotic behavior for sequential I/O and point queries as a $B$-tree. The advantage of a $B^\varepsilon$ tree is that it can also ingest small, random writes 1-2 orders of magnitude faster than $B$-trees and other standard on-disk data structures. The goal of BetrFS is to realize performance that strictly dominates the performance of current, general-purpose file systems.