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:
Jun. 01, 2021

Filed:

Nov. 21, 2017
Applicant:

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

Inventors:

Georgios Giannikis, Zurich, CH;

Seema Sundara, Nashua, NH (US);

Sabina Petride, Tracy, CA (US);

Nipun Agarwal, Saratoga, CA (US);

Assignee:

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

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 17/00 (2019.01); G06F 16/21 (2019.01); G06F 16/22 (2019.01); G06F 16/23 (2019.01); H03M 7/30 (2006.01); H03M 7/00 (2006.01);
U.S. Cl.
CPC ...
G06F 16/213 (2019.01); G06F 16/221 (2019.01); G06F 16/2246 (2019.01); G06F 16/2255 (2019.01); G06F 16/2282 (2019.01); G06F 16/23 (2019.01); G06F 16/2343 (2019.01); H03M 7/00 (2013.01); H03M 7/3088 (2013.01); H03M 7/6058 (2013.01);
Abstract

Techniques related to a sparse dictionary tree are disclosed. In some embodiments, computing device(s) execute instructions, which are stored on non-transitory storage media, for performing a method. The method comprises storing an encoding dictionary as a token-ordered tree comprising a first node and a second node, which are adjacent nodes. The token-ordered tree maps ordered tokens to ordered codes. The ordered tokens include a first token and a second token. The ordered codes include a first code and a second code, which are non-consecutive codes. The first node maps the first token to the first code. The second node maps the second token to the second code. The encoding dictionary is updated based on inserting a third node between the first node and the second node. The third node maps a third token to a third code that is greater than the first code and less than the second code.


Find Patent Forward Citations

Loading…