Hewlett Packard Enterprise Development LP

Ammar Ekbote

Praveen Killamsetti

Rajat Sharma

Anirudha Kumar

Kumar Thangavelu

Tomasz Barszczak

Monil Sanghavi

Franklin George

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.

Tree structure node compaction prioritization

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.

Generating snapshots of a key-value index

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.

Key-value index with node buffers

Examples described herein include receiving a first data write request from a host computing device, assigning a first identification to the first data write request, recording the first identification in in-flight data, transmitting the first data write request to a second storage array, receiving a first acknowledgement of the first data write request from the second storage array, and recording an indicator representing a group of acknowledgements. In some examples, the group of acknowledgements comprises the first acknowledgment.

Growing community of inventors

San Jose, CA, United States of America

Ammar Ekbote