VMware, Inc.
Auto-tuned write-optimized key-value store

Abstract:

A B.sup..epsilon.-tree associated with a file system on a storage volume includes a hierarchy of nodes. Each node includes a buffer portion to store key-value pairs as messages in the buffer. Each node can be characterized by having a maximum allowable size that is periodically updated at run time. The buffers in the nodes of the B.sup..epsilon.-tree are therefore characterized by having a maximum allowed size that can vary over time.