>the data was fragmented in such a way that efficient lookup was possible Yeah, there's a build step that sorts and arranges data into "cells", making binary s

>the data was fragmented in such a way that efficient lookup was possible Yeah, there's a build step that sorts and arranges data into "cells", making binary search possible. Not sure about kernel/user space. I'm just calling `pread` from ruby, so only a few bytes are loaded per lookup.