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:
May. 25, 2021

Filed:

Oct. 24, 2017
Applicant:

Oracle International Corporation, Redwood Shores, CA (US);

Inventors:

Adison H. Wongkar, Austin, TX (US);

Padmanabhan Natarajan, Shoreline, WA (US);

Jeevan Gheevarghese Joseph, Dublin, CA (US);

Kendra Mariko Chen, San Jose, CA (US);

Vernon W. Hui, Bellevue, WA (US);

Assignee:

Oracle International Corporation, Redwood Shores, CA (US);

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06N 5/04 (2006.01); G06F 17/11 (2006.01); G06F 16/901 (2019.01); G06Q 30/02 (2012.01); G06N 7/00 (2006.01);
U.S. Cl.
CPC ...
G06N 5/04 (2013.01); G06F 16/9014 (2019.01); G06F 17/11 (2013.01); G06Q 30/0201 (2013.01); G06Q 30/0241 (2013.01); G06Q 30/0269 (2013.01); G06N 7/005 (2013.01);
Abstract

Techniques are provided for accurately and quickly processing distributed stored objects to provide a timely and accurate prediction of the number of live objects a parameterized file request will produce. Stored objects representing previous user webpage visit interactions are stored in different storage locations in a data store. The stored objects at each storage location are processed in parallel by hashing stored objects with a hash function such that they are spread somewhat uniformly into buckets. Sub-buckets in each bucket are formed that correspond to selected category identifiers. Also in parallel, K-minimum values are computed for each sub-bucket to estimate the count of stored objects in the data store. The K-minimum values for sub-buckets corresponding to the same category ID across all buckets are combined, in some cases harmonically, and used to generate a predicted number of live objects responsive to a parameterized file request.


Find Patent Forward Citations

Loading…