The B ε-tree File System, or BetrFS,(pronounced “better eff ess”) is the first in-kernel file
system to use a write-optimized index. Write optimized indexes (WOIs) are promising …

Advanced data management has always been at the core of efficient database and
information systems. Recent trends like big data and cloud computing have aggravated the …

File systems that employ write-optimized dictionaries (WODs) can perform random-writes,
metadata updates, and recursive directory traversals orders of magnitude faster than …

The Bε-tree File System, or B e trFS (pronounced “better eff ess”), is the first in-kernel file
system to use a write-optimized data structure (WODS). WODS are promising building …

The Full Path to Full-Path Indexing Page 1 This paper is included in the Proceedings of the
16th USENIX Conference on File and Storage Technologies. February 12–15, 2018 • Oakland …

The skip list is an elegant dictionary data structure that is commonly deployed in RAM. A skip
list with N elements supports searches, inserts, and deletes in O (log N) operations with high …

Storage devices have complex performance profiles, including costs to initiate IOs (eg, seek
times in hard drives), parallelism and bank conflicts (in SSDs), costs to transfer data, and …

We consider the dictionary problem in external memory and improve the update time of the
well-known buffer tree by roughly a logarithmic factor. For any λ> max (lg lg n, logM/B (n/B)} …

Given an input stream of size N, a φ-heavy hitter is an item that occurs at least φ N times in
S. The problem of finding heavy-hitters is extensively studied in the database literature. We …

Buffer-and-flush is a technique for transforming standard external-memory search trees into
write-optimized search trees. In exchange for faster amortized insertions, buffer-and-flush …