公开(公告)号：US11461299B2

公开(公告)日：2022-10-04

申请号：US16916623

申请日：2020-06-30

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Praveen Killamsetti ,  Anirudha Kumar ,  Rajat Sharma ,  Ammar Ekbote ,  Kumar Thangavelu

IPC: G06F16/22

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.

公开(公告)号：US20210406236A1

公开(公告)日：2021-12-30

申请号：US16916645

申请日：2020-06-30

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Praveen Killamsetti ,  Anirudha Kumar ,  Rajat Sharma ,  Ammar Ekbote ,  Kumar Thangavelu

IPC: G06F16/22

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.

公开(公告)号：US11853577B2

公开(公告)日：2023-12-26

申请号：US17449100

申请日：2021-09-28

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Anirudha Kumar ,  Ammar Govind Ekbote ,  Kumar Valendhar Thangavelu ,  Franklin George ,  Rajat Sharma

IPC: G06F16/22 ,  G06F3/06 ,  G06F16/14 ,  G06F17/18

CPC classification number: G06F3/0641 ,  G06F3/0608 ,  G06F3/0683 ,  G06F16/152 ,  G06F16/2246 ,  G06F17/18

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.

公开(公告)号：US20230113412A1

公开(公告)日：2023-04-13

申请号：US17449100

申请日：2021-09-28

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Anirudha Kumar ,  Ammar Govind Ekbote ,  Kumar Valendhar Thangavelu ,  Franklin George ,  Rajat Sharma

IPC: G06F3/06 ,  G06F16/14 ,  G06F17/18

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.

公开(公告)号：US20210406237A1

公开(公告)日：2021-12-30

申请号：US16916667

申请日：2020-06-30

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Praveen Killamsetti ,  Anirudha Kumar ,  Rajat Sharma ,  Ammar Ekbote ,  Kumar Thangavelu

IPC: G06F16/22

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.

公开(公告)号：US10241680B2

公开(公告)日：2019-03-26

申请号：US15445890

申请日：2017-02-28

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Ashutosh Datar ,  Rajat Sharma ,  Sandeep Karmarkar

IPC: G06F12/10 ,  G06F3/06

Abstract: Methods for estimating cost savings in a storage system using an external host system. One method includes accessing over a communication network data from a unit of storage of a data storage system, wherein each of the blocks of data is uncompressed. A plurality of blocks is parsed from the data. A plurality of fingerprints is generated from the blocks using a hash algorithm. A deduplication ratio is estimated for the plurality of blocks stored in the unit of storage using a hyperloglog algorithm and a first plurality of buckets compartmentalizing the plurality of blocks, wherein the first plurality of buckets is defined by precision bits of the plurality of fingerprints. An effective compression ratio is estimated for the plurality of blocks stored in the unit of storage using the hyperloglog algorithm and a second plurality of buckets compartmentalizing the plurality of blocks, wherein the second plurality of buckets is defined by ranges of compression ratios.

公开(公告)号：US10027984B2

公开(公告)日：2018-07-17

申请号：US15590438

申请日：2017-05-09

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Gurunatha Karaje ,  Hy Vu ,  Rajat Sharma ,  Senthil Kumar Ramamoorthy ,  Srikant Varadan

IPC: G11C29/40 ,  H04N19/66 ,  H04N19/119 ,  H04N19/14 ,  H04N19/42 ,  H04N19/68 ,  H04N19/86

Abstract: When data blocks of a data seglet are compressed using a shared dictionary and when the requested data block (or blocks) do not include the last data block of the data seglet, an optimization in the read path may involve decompressing a certain portion of the data seglet from a starting position of the data seglet to a decompression endpoint of the data seglet, but not including the portion of the data seglet following the decompression endpoint. Such technique may involve the storing of a mapping that maps, for each data block within the data seglet, an identifier of the data block to a decompression endpoint that indicates a portion of the data seglet that includes the data block.

公开(公告)号：US20180152733A1

公开(公告)日：2018-05-31

申请号：US15590438

申请日：2017-05-09

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Gurunatha Karaje ,  Hy Vu ,  Rajat Sharma ,  Senthil Kumar Ramamoorthy ,  Srikant Varadan

IPC: H04N19/66 ,  H04N19/119 ,  H04N19/14 ,  H04N19/42 ,  H04N19/68 ,  H04N19/86

CPC classification number: H04N19/66 ,  G11C7/1051 ,  G11C7/1078 ,  G11C29/40 ,  H04N19/119 ,  H04N19/14 ,  H04N19/42 ,  H04N19/68 ,  H04N19/865

Abstract: When data blocks of a data seglet are compressed using a shared dictionary and when the requested data block (or blocks) do not include the last data block of the data seglet, an optimization in the read path may involve decompressing a certain portion of the data seglet from a starting position of the data seglet to a decompression endpoint of the data seglet, but not including the portion of the data seglet following the decompression endpoint. Such technique may involve the storing of a mapping that maps, for each data block within the data seglet, an identifier of the data block to a decompression endpoint that indicates a portion of the data seglet that includes the data block.

公开(公告)号：US11556513B2

公开(公告)日：2023-01-17

申请号：US16916645

申请日：2020-06-30

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Praveen Killamsetti ,  Anirudha Kumar ,  Rajat Sharma ,  Ammar Ekbote ,  Kumar Thangavelu

IPC: G06F16/00 ,  G06F16/22

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.

公开(公告)号：US20210406235A1

公开(公告)日：2021-12-30

申请号：US16916623

申请日：2020-06-30

Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

Inventor： Praveen Killamsetti ,  Anirudha Kumar ,  Rajat Sharma ,  Ammar Ekbote ,  Kumar Thangavelu

IPC: G06F16/22

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.