Wormhole: A Fast Ordered Index for In-Memory Data Management (EuroSys'19)github.com/wuxb45 3 pointswuxb7 years ago2 commentsSaveHideCopy link On HNComments−wuxbOP7yPaper: https://www.cs.uic.edu/~wuxb/papers/wormhole.pdf−wuxbOP7yIn 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.
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.