×

Estimating a number of entries in a dispersed hierarchical index

  • US 10,387,382 B2
  • Filed: 10/27/2016
  • Issued: 08/20/2019
  • Est. Priority Date: 12/30/2015
  • Status: Active Grant
First Claim
Patent Images

1. A method of estimating a number of entries in a dispersed hierarchical index of a dispersed storage network comprising:

  • determining a number of walks to perform on the dispersed hierarchical index of the dispersed storage network to produce a determination, where the dispersed hierarchical index includes a root node, a plurality of index nodes and a plurality of leaf nodes, where the root node indexes the plurality of index nodes, and the plurality of index nodes index the plurality of leaf nodes;

    conducting a plurality of walks based on the determination, where each respective walk of the plurality of walks starts at the root node and ends at a respective leaf node of the plurality of leaf nodes;

    determining a respective number of walk entries associated with each respective walk of the plurality of walks; and

    averaging the respective number of walk entries associated with each respective walk of the plurality of walks to produce an estimated total number of entries for the dispersed hierarchical index.

View all claims
  • 3 Assignments
Timeline View
Assignment View
    ×
    ×