US 12,282,512 B2
Searching a subset of a database having search tokens
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 Mar. 12, 2024, as Appl. No. 18/603,024.
Application 18/603,024 is a continuation of application No. 18/134,705, filed on Apr. 14, 2023, granted, now 11,941,061.
Application 18/134,705 is a continuation of application No. 17/318,324, filed on May 12, 2021, granted, now 11,657,097, issued on May 23, 2023.
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.
Prior Publication US 2024/0220544 A1, Jul. 4, 2024
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)] 19 Claims
OG exemplary drawing
 
1. A method comprising:
parsing a textual search query into a plurality of search tokens;
selecting a search token from the textual search query based on a frequency value of one or more of a plurality of tokens,
wherein the plurality of tokens is created by parsing text of items,
wherein each token of the plurality of tokens includes a plurality of characters having a frequency value, and
wherein the frequency value is indicative of a frequency with which each token appears in the database;
searching a subset of a database for at least a portion of contents of the textual search query, wherein the subset of the database includes items having the search token; and
providing a subset of the items that satisfy the textual search query.