Short-term hashes
First Claim
Patent Images
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 Assignments
0 Petitions
Accused Products
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.
-
Citations
15 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. - View Dependent Claims (2, 3, 4, 5)
-
-
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. - View Dependent Claims (7, 8, 9, 10)
-
-
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. - View Dependent Claims (12, 13, 14, 15)
- one or more processors; and
Specification