Automatic partitioning
US-12164512-B2 · Dec 10, 2024 · US
US2018018366A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2018018366-A1 |
| Application number | US-201515544713-A |
| Country | US |
| Kind code | A1 |
| Filing date | Feb 3, 2015 |
| Priority date | Feb 3, 2015 |
| Publication date | Jan 18, 2018 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Example implementations relate to records based on bit-shifting. For example, a computing device may include at least one processor to receive a query, create a normalized query, and generate a mapping of the normalized query for each record in a set of records in a database using a state array, the mapping being based on bit-shifting of bits associated with similarities between each character in the normalized query and each character in a field of the respective record in the set of records, each successive level of the state array indicating a stronger match between the query and the respective record than an immediately prior level in the state array. The processor may calculate a score associated with each record based on the respective mapping and may provide a subset of the set of records in response to the query based on the score associated with each record.
Opening claim text (preview).
What is claimed is: 1 . A computing device comprising: at least one processor to: receive a query; create a normalized query, the normalized query being a normalized version of the query; generate a mapping of the normalized query for each record in a set of records in a database using a state array, the mapping being based on bit-shifting of bits associated with similarities between each character in the normalized query and each character in a field of the respective record in the set of records, each successive level of the state array indicating a stronger match between the query and the respective record than an immediately prior level in the state array; calculate a score associated with each record based on the respective mapping; and provide a subset of the set of records in response to the query based on the score associated with each record in the subset of records. 2 . The computing device of claim 1 , wherein the at least one processor is further to pre-filter records in the database based on the query, the set of records being based on the pre-filtering. 3 . The computing device of claim 1 , wherein the subset of records includes records having scores within a particular range with respect to scores of other records in the set of records. 4 . The computing device of claim 1 , wherein the mapping is generated based on an enabled bit associated with a query character being shifted if the query character is similar to a corresponding record character. 5 . The computing device of claim 1 , wherein an array length of the state array is based on a query length of the query. 6 . The computing device of claim 1 , wherein the score associated with each record is tracked using an accumulator array and wherein the accumulator array includes a zero associated with each space character in the field of the respective record. 7 . A method comprising: receiving, by a computing device, a query; standardizing, by the computing device, the query into a normalized query; creating, by the computing device, a normalized record for each record in a set of records in a database; producing, by the computing device, a mapping of the normalized query for each normalized record using a state array, the mapping being based on bit-shifting of bits associated with similarities between each character in the normalized query and each character in a field of the respective normalized record, each successive level of the state array indicating a stronger match between the query and the respective normalized record than an immediately prior level in the state array; identifying, by the computing device, a score associated with each record based on the respective mapping; and returning, by the computing device, a subset of the set of records in response to the query based on the score associated with each record in the subset of records. 8 . The method of claim 7 , further comprising: pre-filtering records in the database based on the query, the set of records being based on the pre-filtering. 9 . The method of claim 7 , wherein an array length of the state array is based on a query length of the query. 10 . The method of claim 7 , wherein the mapping is produced based on an enabled bit associated with a query character being shifted if the query character is similar to a corresponding record character. 11 . A non-transitory machine-readable storage medium storing instructions that, if executed by at least one processor of a computing device, cause the computing device to: receive a query; normalize the query into a normalized query; normalize each record in a set of records in a database into a normalized record; create a mapping of the normalized query for each normalized record using a state array, the mapping being based on bit-shifting of bits associated with similarities between each character in the normalized query and each character in a field of the respective normalized record, each successive level of the state array indicating a stronger match between the query and the respective normalized record than an immediately prior level in the state array; determine a score associated with each record based on the respective mapping; and display a subset of the set of records in response to the query based on the score associated with each record in the subset of records. 12 . The non-transitory machine-readable storage medium of claim 11 , wherein the instructions further cause the computing device to: pre-filter records in the database based on the query, the set of records being based on the pre-filtering. 13 . The non-transitory machine-readable storage medium of claim 11 , wherein an array length of the state array is based on a query length of the query. 14 . The non-transitory machine-readable storage medium of claim 11 , wherein the mapping is created based on an enabled bit associated with a query character being shifted if the query character is similar to a corresponding record character. 15 . The non-transitory machine-readable storage medium of claim 11 , wherein the score associated with each record is tracked using an accumulator array and wherein the accumulator array includes a zero associated with each space character in the field of the respective record.
using ranking · CPC title
Presentation of query results · CPC title
Query rewriting; Transformation · CPC title
Physics · mapped topic
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.