Patents by Inventor Ammar Ekbote

Ammar Ekbote has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11556513
    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.
    Type: Grant
    Filed: June 30, 2020
    Date of Patent: January 17, 2023
    Assignee: Hewlett Packard Enterprise Development LP
    Inventors: Praveen Killamsetti, Anirudha Kumar, Rajat Sharma, Ammar Ekbote, Kumar Thangavelu
  • Patent number: 11461299
    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.
    Type: Grant
    Filed: June 30, 2020
    Date of Patent: October 4, 2022
    Assignee: Hewlett Packard Enterprise Development LP
    Inventors: Praveen Killamsetti, Anirudha Kumar, Rajat Sharma, Ammar Ekbote, Kumar Thangavelu
  • Publication number: 20210406236
    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.
    Type: Application
    Filed: June 30, 2020
    Publication date: December 30, 2021
    Inventors: Praveen Killamsetti, Anirudha Kumar, Rajat Sharma, Ammar Ekbote, Kumar Thangavelu
  • Publication number: 20210406237
    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.
    Type: Application
    Filed: June 30, 2020
    Publication date: December 30, 2021
    Inventors: Praveen Killamsetti, Anirudha Kumar, Rajat Sharma, Ammar Ekbote, Kumar Thangavelu
  • Publication number: 20210406235
    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.
    Type: Application
    Filed: June 30, 2020
    Publication date: December 30, 2021
    Inventors: Praveen Killamsetti, Anirudha Kumar, Rajat Sharma, Ammar Ekbote, Kumar Thangavelu
  • Patent number: 10732860
    Abstract: 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.
    Type: Grant
    Filed: July 19, 2018
    Date of Patent: August 4, 2020
    Assignee: Hewlett Packard Enterprise Development LP
    Inventors: Praveen Killamsetti, Tomasz Barszczak, Ammar Ekbote, Monil Mukesh Sanghavi
  • Publication number: 20200026440
    Abstract: 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.
    Type: Application
    Filed: July 19, 2018
    Publication date: January 23, 2020
    Inventors: Praveen Killamsetti, Tomasz Barszczak, Ammar Ekbote, Monil Mukesh Sanghavi