The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Aug. 20, 2019

Filed:

Oct. 27, 2016
Applicant:

International Business Machines Corporation, Armonk, NY (US);

Inventors:

Greg R. Dhuse, Chicago, IL (US);

Kevin M. Freese, Wichita, KS (US);

Jason K. Resch, Chicago, IL (US);

Daniel J. Scholl, Chicago, IL (US);

Ethan S. Wozniak, Park Ridge, IL (US);

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06F 16/182 (2019.01); G06F 16/22 (2019.01); G06F 11/10 (2006.01); G06F 3/06 (2006.01); H03M 13/15 (2006.01); H04L 29/08 (2006.01); H04L 12/26 (2006.01); H03M 13/37 (2006.01); G06F 12/06 (2006.01);
U.S. Cl.
CPC ...
G06F 16/182 (2019.01); G06F 16/2246 (2019.01); G06F 3/0604 (2013.01); G06F 3/067 (2013.01); G06F 3/0631 (2013.01); G06F 3/0665 (2013.01); G06F 11/1076 (2013.01); G06F 11/1092 (2013.01); G06F 12/0684 (2013.01); G06F 2212/154 (2013.01); G06F 2212/263 (2013.01); H03M 13/1515 (2013.01); H03M 13/3761 (2013.01); H04L 43/0852 (2013.01); H04L 43/0876 (2013.01); H04L 43/16 (2013.01); H04L 67/1097 (2013.01);
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.


Find Patent Forward Citations

Loading…