Search query hash

• US 8,458,211 B2
• Filed: 09/16/2011
• Issued: 06/04/2013
• Est. Priority Date: 08/29/2007
• Status: Expired due to Fees

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Google Inc. (Alphabet Inc.)
• Inventors: Ahn, Jungho, Tansuwan, Justin J., Lee, Junyoung
• Primary Examiner(s): HASAN, SYED HAROON
• Application Number:
  US13/234,503
• Publication Number:
  US 20120005197A1
• Time in Patent Office: 627 Days
• Field of Search: None
• US Class Current: 707/769
• CPC Class Codes: G06F 16/435 Filtering based on additional data, e.g. user or group profiles
• CPC Class Codes: G06F 16/735 Filtering based on additional data, e.g. user or group profiles
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: G06F 21/6227 where protection concerns the structure of data, e.g. records, types, queries
• CPC Class Codes: G06F 2221/2141 Access rights, e.g. capability lists, access control lists, access tables, access matrices

Abstract

Apparatus, systems and methods for search filtering hash map are disclosed. Terms are designated as filtering terms, wherein at least one of the filtering terms includes only one component term, and at least one of the filtering terms includes a plurality of component terms in ordinal positions. A keyword hash map is generated for keywords, each keyword being one of the component terms and being mapped to one or more corresponding hashes in the hash map, and each corresponding hash having a corresponding level and a corresponding status, wherein each level corresponds to an ordinal position of its corresponding component term in a filtering term, and wherein each status designates its corresponding component term in the hash map as one of a filtering term or unfiltered term. The keyword hash map is stored in a memory storage system accessible by a data processing apparatus.

Claims

1. A computer implemented method implemented in a data processing apparatus, comprising:

receiving a query from a user device;

segmenting, by a data processing apparatus, the query into query components, each query component being a term in the query;

accessing, by the data processing apparatus, a keyword hash map for a plurality of keywords corresponding to a plurality of filtering terms, wherein at least one of the filtering terms includes only one component term, and at least one of the filtering terms includes a plurality of component terms in ordinal positions, each keyword being one of the component terms and being mapped to one or more corresponding hashes in the hash map, and each corresponding hash having a corresponding level and a corresponding status, wherein each level corresponds to an ordinal position of its corresponding component term in a query and wherein each status designates its corresponding component term in the hash map as one of a filtering term or unfiltered term;

comparing the query components to the keyword hash map; and

determining that the query includes a filtering term when the query components map to component terms in the keyword hash map for which a last query component of a term in the query maps to a component term in the keyword hash map having a status of a filtering term.

2. The method of claim 1, further comprising:

receiving search results that are determined to be responsive to the query;

in response to determining that the query includes the filtering term;

identifying web pages referenced by the search results and that include the filtering term;

generating filtered search results that exclude search results that reference the web pages that are identified as including the filtering term; and

providing only the filtered search results in response to the query.

3. The method of claim 1, further comprising determining that the query does not include a filtering term when the query components map to component terms in the keyword hash map for which a last query component of a term in the query maps to a component term in the keyword hash map having a status of an unfiltered term.

4. The method of claim 1, further comprising determining that the query does not include a filtering term when the query components do not map to component terms in the keyword hash map.

5. A system, comprising:

a data processing apparatus; and

instructions stored in a non-transitory computer readable storage medium accessible by the data processing apparatus and executable by the data processing apparatus that upon such execution cause the data processing apparatus to perform operations comprising;

receiving a query from a user device;

segmenting the query into query components, each query component being a term in the query;

accessing a keyword hash map for a plurality of keywords corresponding to a plurality of filtering terms, wherein at least one of the filtering terms includes only one component term, and at least one of the filtering terms includes a plurality of component terms in ordinal positions, each keyword being one of the component terms and being mapped to one or more corresponding hashes in the hash map, and each corresponding hash having a corresponding level and a corresponding status, wherein each level corresponds to an ordinal position of its corresponding component term in a query and wherein each status designates its corresponding component term in the hash map as one of a filtering term or unfiltered term;

comparing the query components to the keyword hash map; and

determining that the query includes a filtering term when the query components map to component terms in the keyword hash map for which a last query component of a term in the query maps to a component term in the keyword hash map having a status of a filtering term.

6. The system of claim 5, wherein the instructions cause the data processing apparatus to perform operations further comprising:

receiving search results that are determined to be responsive to the query;

in response to determining that the query includes the filtering term;

identifying web pages referenced by the search results and that include the filtering term;

generating filtered search results that exclude search results that reference the web pages that are identified as including the filtering term; and

providing only the filtered search results in response to the query.

7. The system of claim 5, wherein the instructions cause the data processing apparatus to perform operations further comprising determining that the query does not include a filtering term when the query components map to components in the keyword hash map for which a last query component of a term in the query maps to a component term in the keyword hash map having a status of an unfiltered term.

8. The system of claim 5, wherein the instructions cause the data processing apparatus to perform operations further comprising determining that the query does not include a filtering term when the query components do not map to component terms in the keyword hash map.

9. A non-transitory computer readable storage medium storing instructions executable by a data processing apparatus that upon such execution cause the data processing apparatus to perform operations comprising:

receiving a query from a user device;

segmenting the query into query components, each query component being a term in the query;

accessing a keyword hash map for a plurality of keywords corresponding to a plurality of filtering terms, wherein at least one of the filtering terms includes only one component term, and at least one of the filtering terms includes a plurality of component terms in ordinal positions, each keyword being one of the component terms and being mapped to one or more corresponding hashes in the hash map, and each corresponding hash having a corresponding level and a corresponding status, wherein each level corresponds to an ordinal position of its corresponding component term in a query and wherein each status designates its corresponding component term in the hash map as one of a filtering term or unfiltered term;

comparing the query components to the keyword hash map; and

determining that the query includes a filtering term when the query components map to component terms in the keyword hash map for which a last query component of a term in the query maps to a component term in the keyword hash map having a status of a filtering term.

10. The non-transitory computer readable storage medium of claim 9, wherein the instructions cause the data processing apparatus to perform operations further comprising:

receiving search results that are determined to be responsive to the query;

in response to determining that the query includes the filtering term;

identifying web pages referenced by the search results and that include the filtering term;

generating filtered search results that exclude search results that reference the web pages that are identified as including the filtering term; and

providing only the filtered search results in response to the query.

11. The non-transitory computer readable storage medium of claim 9, wherein the instructions cause the data processing apparatus to perform operations further comprising determining that the query does not include a filtering term when the query components map to components in the keyword hash map for which a last query component of a term in the query maps to a component term in the keyword hash map having a status of an unfiltered term.

12. The non-transitory computer readable storage medium of claim 9, wherein the instructions cause the data processing apparatus to perform operations further comprising determining that the query does not include a filtering term when the query components do not map to component terms in the keyword hash map.