Alex Conway is a PhD student in computer science at Rutgers University, where he is advised by Martin Farach-Colton. His research interests are in the theory, application and implementation of external memory data structures and algorithms. He has worked externsively with write-optimized data structures such as $B^\varepsilon$-trees, COLAs, LSMs and BOA/BOT hash tables, from both theoretical and systems perspectives.
He is a member of the BetrFS team, which built and maintains the BetrFS prototype file system. BetrFS is designed around the principles of write-optimization, and is built using variants of $B^\varepsilon$-trees.
PhD Candidate in Computer Science
MS in Mathematics, 2011
BS in Mathematics, 2007
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.