Abstract: In some examples, a system arranges data in a plurality of nodes in a tree structure, where a given node of the plurality of nodes is associated with a probabilistic data structure that provides a probabilistic indication of whether data is present in the given node. The system determines, for reads of the given node, a false positive measure of false positives indicated by the probabilistic data structure, and prioritizes a compaction of the given node based on the determined false positive measure.

Abstract: In some examples, a system samples a subset of input/output (I/O) accesses of a storage, the I/O accesses being part of a workload. The system determines, based on the sampled subset of the I/O accesses, a first reuse distance distribution for a first time interval, determines a similarity measure representing a similarity of the first reuse distance distribution and a second reuse distance distribution for a second time interval different from the first time interval, and based on a change in the similarity measure, triggers a workload placement process to determine a placement of the workload on a compute node of a plurality of compute nodes.

Abstract: In some examples, a system arranges data in a plurality of nodes in a tree structure, where a given node of the plurality of nodes is associated with a probabilistic data structure that provides a probabilistic indication of whether data is present in the given node. The system determines, for reads of the given node, a false positive measure of false positives indicated by the probabilistic data structure, and prioritizes a compaction of the given node based on the determined false positive measure.

Abstract: A computer implemented method may include: storing key-value pairs in an index in persistent storage, where indirect nodes of the index include pointers, where each pointer identifies an index portion and includes a generation identifier for the identified index portion, where the index comprises a plurality of snapshots associated with a plurality of generations; receiving a request to read data of a particular snapshot of the index, wherein the particular snapshot is associated with a particular generation of the plurality of generations; in response to the request, performing a traversal starting from a particular root node associated with the particular generation; and providing the requested data based on the traversal.

Abstract: A computer implemented method may include: receiving write requests to add key-value pairs to an index; storing the key-value pairs in a buffer of an indirect node of the index; determining whether the buffer of the indirect node exceeds a threshold level; and in response to a determination that the buffer of the indirect node exceeds the threshold level, transferring the key-value pairs stored in the buffer of the indirect node to buffers of a plurality of child nodes, where each buffer of the plurality of child nodes is smaller than the buffer of the indirect node.

Abstract: A computer implemented method may include: receiving a read request for a key-value pair in an index, wherein each indirect node of the index comprises a buffer and a Bloom filter, and wherein sizes of the Bloom filters vary across the levels according to a predefined function; responsive to a read request for the key-value pair, determining whether the Bloom filter of the indirect node indicates that the buffer of the indirect node includes the key-value pair; and responsive to a determination that the Bloom filter of the indirect node indicates that the buffer of the indirect node includes the key-value pair, searching the buffer of the indirect node for the key-value pair.

Abstract: A computer implemented method may include: storing key-value pairs in an index in persistent storage, where indirect nodes of the index include pointers, where each pointer identifies an index portion and includes a generation identifier for the identified index portion, where the index comprises a plurality of snapshots associated with a plurality of generations; receiving a request to read data of a particular snapshot of the index, wherein the particular snapshot is associated with a particular generation of the plurality of generations; in response to the request, performing a traversal starting from a particular root node associated with the particular generation; and providing the requested data based on the traversal.

Abstract: A computer implemented method may include: receiving write requests to add key-value pairs to an index; storing the key-value pairs in a buffer of an indirect node of the index; determining whether the buffer of the indirect node exceeds a threshold level; and in response to a determination that the buffer of the indirect node exceeds the threshold level, transferring the key-value pairs stored in the buffer of the indirect node to buffers of a plurality of child nodes, where each buffer of the plurality of child nodes is smaller than the buffer of the indirect node.