US 11,853,577 B2
Tree structure node compaction prioritization
Anirudha Kumar, San Jose, CA (US); Ammar Govind Ekbote, Renton, WA (US); Kumar Valendhar Thangavelu, San Jose, CA (US); Franklin George, San Jose, CA (US); and Rajat Sharma, San Jose, CA (US)
Assigned to Hewlett Packard Enterprise Development LP, Spring, TX (US)
Filed by HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP, Houston, TX (US)
Filed on Sep. 28, 2021, as Appl. No. 17/449,100.
Prior Publication US 2023/0113412 A1, Apr. 13, 2023
Int. Cl. G06F 16/22 (2019.01); G06F 3/06 (2006.01); G06F 16/14 (2019.01); G06F 17/18 (2006.01)
CPC G06F 3/0641 (2013.01) [G06F 3/0608 (2013.01); G06F 3/0683 (2013.01); G06F 16/152 (2019.01); G06F 16/2246 (2019.01); G06F 17/18 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A non-transitory machine-readable storage medium comprising instructions that upon execution cause a system to:
arrange data in a plurality of nodes in a tree structure, the plurality of nodes comprising higher level nodes and lower level nodes, wherein 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;
determine, for reads of the given node, a false positive measure of false positives indicated by the probabilistic data structure, wherein a false positive occurs if the probabilistic data structure indicates that data is present in the given node when the data is not present in the given node; and
prioritize a compaction of the given node based on the determined false positive measure, wherein the compaction of the given node comprises transferring data in the given node to another node in the tree structure.