Back to results
US 11,636,100 B2Granted
Systems and methods for compression-based search engine
AssigneeVerizon Patent and Licensing Inc.
InventorsHerbert Shin, Jose A. Ocasio Serra
Life of this patent
Estimating the term…
Abstract
A system described herein may provide a technique for the compression of query terms and search data against which the query terms may be evaluated. The compression may be dynamic, in that a quantity of bits used to compress the search data and query terms may be based on a quantity of unique characters included in a given query term. The compression may further include reducing the volume of search data by compressing entire words, that do not include any of the unique characters of the query term, to one particular code.
Claims20
A device, comprising:
- one or more processors configured to:
- receive a query term comprising a first set of strings;
- receive search data comprising a second set of strings;
- identify a particular set of characters that are included in the first set of strings;
- identify a compression space based on the particular set of characters included in the first set of strings, wherein identifying the compression space includes determining a quantity of bits to use to represent the particular set of characters included in the first and second sets of strings, the quantity of bits being based on a quantity of unique characters in the first set of strings;
- compress the first set of strings based on the identified compression space;
- compress the second set of strings based on the identified compression space;
- compare the compressed first set of strings to the compressed second set of strings to determine whether the second set of strings includes any strings of the first set of strings;
- and
- generate a search result, based on the comparing, that indicates instances of the first set of strings that were identified in the second set of strings.
7 more elements
A non-transitory computer-readable medium, storing a plurality of processor-executable instructions to:
- receive a query term comprising a first set of strings;
- receive search data comprising a second set of strings;
- identify a particular set of characters that are included in the first set of strings;
- identify a compression space based on the particular set of characters included in the first set of strings, wherein identifying the compression space includes determining a quantity of bits to use to represent the particular set of characters included in the first and second sets of strings, the quantity of bits being based on a quantity of unique characters in the first set of strings;
- compress the first set of strings based on the identified compression space;
- compress the second set of strings based on the identified compression space;
- compare the compressed first set of strings to the compressed second set of strings to determine whether the second set of strings includes any strings of the first set of strings;
- and
- generate a search result, based on the comparing, that indicates instances of the first set of strings that were identified in the second set of strings.
6 more elements
A method, comprising:
- receiving a query term comprising a first set of strings;
- receiving search data comprising a second set of strings;
- identifying a particular set of characters that are included in the first set of strings;
- identifying a compression space based on the particular set of characters included in the first set of strings, wherein identifying the compression space includes determining a quantity of bits to use to represent the particular set of characters included in the first and second sets of strings, the quantity of bits being based on a quantity of unique characters in the first set of strings;
- compressing the first set of strings based on the identified compression space;
- compressing the second set of strings based on the identified compression space;
- comparing the compressed first set of strings to the compressed second set of strings to determine whether the second set of strings includes any strings of the first set of strings;
- and
- generating a search result, based on the comparing, that indicates instances of the first set of strings that were identified in the second set of strings.
6 more elements
Dependencies are inferred from the claim text.