I have implemented a skip list library that stores all nodes of the same "level" together in the same file/memory map. This fixes the cache locality problem.

I have implemented a skip list library that stores all nodes of the same "level" together in the same file/memory map. This fixes the cache locality problem. Skip lists also lend themselves well to concurrent multi-threaded access, especially update and deletion.