Short-term hashes

• US 9,171,063 B2
• Filed: 03/13/2013
• Issued: 10/27/2015
• Est. Priority Date: 03/13/2013
• Status: Expired due to Fees

• 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
• Primary Examiner(s): Perveen, Rehana
• Assistant Examiner(s): Tran, Loc
• Application Number:
  US13/799,772
• Publication Number:
  US 20140280041A1
• Time in Patent Office: 958 Days
• Field of Search: 707/722, 707/736
• US Class Current: 1/1
• 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, accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising;

a first node corresponding to a first user associated with an online social network; and

a plurality of second nodes that each correspond to an object associated with the online social network, each object being of a particular object type;

by one or more computing devices, receiving a search query from the first user;

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, wherein each prefix corresponds to an edge type and an object type of the social graph, and wherein each suffix corresponds to a particular node of the plurality of nodes;

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, wherein each search result corresponds to a node of the plurality of second nodes; and

by one or more computing devices, 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 comprises, by one or more computing devices:

generating a second binary number based on the prefix;

generating a third binary number based on the particular object type of the object that corresponds to the node corresponding to 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 1, wherein the object corresponds to a user, a concept, or a map tile.

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

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

access a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising;

a first node corresponding to a first user associated with an online social network; and

a plurality of second nodes that each correspond to an object associated with the online social network, each object being of a particular object type;

receive a search query from the first user;

determine one or more search terms based on the received search query, each search term comprising a prefix and a suffix, wherein each prefix corresponds to an edge type and an object type of the social graph, and wherein each suffix corresponds to a particular node of the plurality of nodes;

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, wherein each search result corresponds to a node of the plurality of second nodes; and

aggregate search results of the respective search terms.

7. The media of claim 6, 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 the particular object type of the object that corresponds to the node corresponding to the suffix; and

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

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

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

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

11. A system comprising:

one or more processors; and

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

access a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising;

a first node corresponding to a first user associated with an online social network; and

a plurality of second nodes that each correspond to an object associated with the online social network, each object being of a particular object type;

receive a search query from the first user;

determine one or more search terms based on the received search query, each search term comprising a prefix and a suffix, wherein each prefix corresponds to an edge type and an object type of the social graph, and wherein each suffix corresponds to a particular node of the plurality of nodes;

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, wherein each search result corresponds to a node of the plurality of second nodes; and

aggregate search results of the respective search terms.

12. The system of claim 11, 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 the particular object type of the object that corresponds to the node corresponding to the suffix; and

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

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

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

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