Wormhole: A Fast Ordered Index for In-Memory Data Management (EuroSys'19) (github.com) 3 points by wuxb 7y ago ↗ HN
[–] wuxb 7y ago ↗ 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.
2 comments
[ 6.8 ms ] story [ 16.7 ms ] thread