Estimating a number of entries in a dispersed hierarchical index
US10387382B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 27, 2016 |
| Grant date | Aug 20, 2019 |
| Priority date | — |
| Expiry date | Feb 7, 2038 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L67/1097
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Methods and systems for estimating a number of entries in a dispersed hierarchical index. The method and systems involve determining a number of random walks N to perform on the dispersed hierarchical index, conducting N walkthroughs based on the number of walkthroughs, determining a number of walk entries for each of the N random walks and averaging the number of walk entries for each of the N random walks to produce an estimated total number of entries for the dispersed hierarchical index. The determining may be based on one or more of a number of levels, a desired confidence interval, a predetermination, and interpretation of system registry information, and an interpretation of a request. Each random walk starts at a root node and ends at a leaf node through L levels of the dispersed hierarchical index.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.