VMware, Inc.
Large range lookups for B.sup. -tree

Abstract:

Embodiments herein are directed towards systems and methods for performing range lookups in B.sup..epsilon.-trees. One example method involves receiving a request to return key-value pairs within a range of keys from the B.sup..epsilon.-tree. The B.sup..epsilon.-tree includes a plurality of nodes, each node being associated with a buffer that stores key-value pairs. The method further involves determining a fractional size of the range of keys. The method further involves, for each level of the B.sup..epsilon.-tree, obtaining from within one or more buffers of one or more nodes of the level, a set of key-value pairs within the range of keys up to a size equal to the fractional size and transferring the set of key-value pairs to a result data structure. The method further involves sorting and merging all key-value pairs in the result data structure and returning the result data structure in response to the request.