US 11,941,061 B1
Tokenized cache
Dermot Pope, Gibsonia, PA (US); and Aaron Manuel, Cranberry Township, PA (US)
Assigned to PRODIGO SOLUTIONS INC., Cranberry Township, PA (US)
Filed by Prodigo Solutions Inc., Cranberry Township, PA (US)
Filed on Apr. 14, 2023, as Appl. No. 18/134,705.
Application 18/134,705 is a continuation of application No. 17/318,324, filed on May 12, 2021, granted, now 11,657,097.
Application 17/318,324 is a continuation of application No. 15/934,019, filed on Mar. 23, 2018, granted, now 11,048,759, issued on Jun. 29, 2021.
Claims priority of provisional application 62/477,181, filed on Mar. 27, 2017.
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/903 (2019.01); G06F 12/0875 (2016.01); G06F 17/18 (2006.01); G06F 40/216 (2020.01)
CPC G06F 16/90344 (2019.01) [G06F 12/0875 (2013.01); G06F 17/18 (2013.01); G06F 40/216 (2020.01); G06F 2212/45 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
parsing text of items in a database to create a plurality of tokens, wherein each token of the plurality of tokens includes a plurality of characters having a length and a frequency value, wherein the frequency value is indicative of a frequency with which that token appears in the database;
storing the plurality of tokens in a memory cache;
receiving a textual search query having contents;
parsing the textual search query into tokens;
selecting a search token from the textual search query based on the frequency value of one of the plurality of tokens in the memory cache;
searching a subset of the database for the contents of the textual search query, wherein the subset of the database includes items having the search token; and
providing the items as a result.