Short-Term Hashes

• US 20140280041A1
• Filed: 03/13/2013
• Published: 09/18/2014
• Est. Priority Date: 03/13/2013
• Status: Active Grant

• Current Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Original Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Inventors: Bosman, Tudor, Lassen, Soren Bogh
• Granted Patent: US 9,171,063 B2
• Time in Patent Office: Days
• US Class Current: 707/722
• CPC Class Codes: G06F 16/325 Hash tables
• CPC Class Codes: G06F 16/9014 hash tables
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

In one embodiment, a server receives a search query; the server determines search terms based on the received search query, each search term including a prefix and a suffix; for each of the search term, the server generates a first binary number based on the each search term'"'"'s prefix and suffix, and accesses and retrieves search results of the each search term from data stores by hashing the first binary number; the server also aggregates search results of the respective search terms.

Claims

1. A method comprising:

by one or more computing devices, receiving a search query;

by one or more computing devices, determining one or more search terms based on the received search query, each search term comprising a prefix and a suffix;

by one or more computing devices, for each of the search terms;

generating a first binary number based on the each search term'"'"'s prefix and suffix; and

accessing and retrieving one or more search results of the each search term from one or more data stores by hashing the first binary number; and

by one or more computing device, aggregating search results of the respective search terms.

2. The method of claim 1, wherein the generating a first binary number based on the each search term'"'"'s prefix and suffix further comprising, by one or more computing devices:

generating a second binary number based on the prefix;

generating a third binary number based on an object type of the suffix; and

generating the first binary number by concatenating the second and the third binary numbers.

3. The method of claim 2, wherein a length of the third binary number is determined based on the object type of the suffix.

4. The method of claim 2, wherein the suffix is directed to an object of a social graph of a social-networking system.

5. The method of claim 4, wherein the object corresponds to a user, a concept, or a map tile.

6. The method of claim 1, wherein a social-networking system comprises the computing devices and the data stores.

7. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:

receive a search query;

determine one or more search terms based on the received search query, each search term comprising a prefix and a suffix;

for each of the search terms;

generate a first binary number based on the each search term'"'"'s prefix and suffix; and

access and retrieve one or more search results of the each search term from one or more data stores by hashing the first binary number;

and

aggregate search results of the respective search terms.

8. The media of claim 7, wherein to generate a first binary number based on the each search term'"'"'s prefix and suffix further comprising, the software is operable when executed to:

generate a second binary number based on the prefix;

generate a third binary number based on an object type of the suffix; and

generate the first binary number by concatenating the second and the third binary numbers.

9. The media of claim 8, wherein a length of the third binary number is determined based on the object type of the suffix.

10. The media of claim 8, wherein the suffix is directed to an object of a social graph of a social-networking system.

11. The media of claim 10, wherein the object corresponds to a user, a concept, or a map tile.

12. The media of claim 7, wherein a social-networking system comprises the computing devices and the data stores.

13. A system comprising:

one or more processors; and

a memory coupled to the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to;

receive a search query;

determine one or more search terms based on the received search query, each search term comprising a prefix and a suffix;

for each of the search terms;

generate a first binary number based on the each search term'"'"'s prefix and suffix; and

access and retrieve one or more search results of the each search term from one or more data stores by hashing the first binary number;

and

aggregate search results of the respective search terms.

14. The system of claim 13, wherein to generate a first binary number based on the each search term'"'"'s prefix and suffix further comprising, the processors are operable when executed the instructions to:

generate a second binary number based on the prefix;

generate a third binary number based on an object type of the suffix; and

generate the first binary number by concatenating the second and the third binary numbers.

15. The system of claim 14, wherein a length of the third binary number is determined based on the object type of the suffix.

16. The system of claim 14, wherein the suffix is directed to an object of a social graph of a social-networking system.

17. The system of claim 16, wherein the object corresponds to a user, a concept, or a map tile.

18. The system of claim 13, wherein a social-networking system comprises the computing devices and the data stores.