Wormhole: A Fast Ordered Index for In-Memory Data Management (EuroSys'19)

github.com

3 pointswuxb2 comments

Paper: https://www.cs.uic.edu/~wuxb/papers/wormhole.pdf

In this paper we introduce a new ordered index structure, named Wormhole, that takes O(log L) worst-case time for looking up a key with a length of L.

Reply on news.ycombinator.com