Social static ranking for search
View Patent ↗In one embodiment, one or move computing devices receive, from a client device of a first user, a query corresponding to a first node type of a plurality of node types. The computer devices search one or more search indices to identify one or more nodes of a social graph matching the query. The search indices maintain an index of a plurality of nodes of the first node type, each node of the plurality of nodes having a static rank which is based at least in part on a pre-calculated value for each node. The computer devices send, to the client device of the first user for display, a search-results interface responsive to the received query. The search-results interface includes reference to one or more nodes each corresponding to the first node type and having a static rank greater than a threshold rank.
1. A method comprising, by one or more computing devices:
receiving, from a client device of a first user, a query corresponding to a first node type of a plurality of node types;
searching one or more search indices to identify one or more nodes of a social graph matching the query, wherein the search indices maintain an index of a plurality of nodes of the first node type, each node of the plurality of nodes having a static rank which is based at least in part on a pre-calculated value for each node, wherein the value is calculated based on one or more sub-values corresponding to one or more factors, respectively, wherein the factors comprise a number of edges of a particular edge type that are connected to the node or attributes of edges connected to the node; and
sending, to the client device of the first user for display, a search-results interface responsive to the received query, the search-results interface comprising reference to one or more nodes each corresponding to the first node type and having a static rank greater than a threshold rank.
2. The method of claim 1 , wherein the first node type comprises one of users, places, pages, groups, posts, images, videos, applications, or events.
3. The method of claim 1 , wherein the static rank is independent of the query.
4. The method of claim 1 , wherein the value is calculated according to a pre-determined ranking criteria, and wherein different search indices have different ranking criteria.
5. The method of claim 1 , wherein the sub-values are calculated based on, for each of one or more edge types connected to the node:
determining an number of edges of the edge type connected to the node; and
multiplying the number of edges of the edge type by a weight corresponding to the edge type.
6. The method of claim 1 , wherein the search indices are stored within a social-networking system.
7. The method of claim 1 , further comprising:
accessing the social graph, wherein the social graph comprises a plurality of nodes and a plurality of edges connecting the nodes, the nodes comprising:
a first node corresponding to the first user; and
plurality of second nodes corresponding to a plurality of objects, respectively, each object being of a particular object type.
8. The method of claim 1 , where in the search-results interface is a user interface of a native application associated with an online social network on a client device of the first user.
9. The method of claim 1 , wherein the search-results interface is a webpage of an online social network accessed by a browser client of the client device of the first user.
10. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
receive, from a client device of a first user, a query corresponding to a first node type of a plurality of node types;
search one or more search indices to identify one or more nodes of a social graph matching the query, wherein the search indices maintain an index of a plurality of nodes of the first node type, each node of the plurality of nodes having a static rank which is based at least in part on a pre-calculated value for each node, wherein the value is calculated based on one or more sub-values corresponding to one or more factors, respectively, wherein the factors comprise a number of edges of a particular edge type that are connected to the node or attributes of edges connected to the node; and
send, to the client device of the first user for display, a search-results interface responsive to the received query, the search-results interface comprising reference to one or more nodes each corresponding to the first node type and having a static rank greater than a threshold rank.
11. The media of claim 10 , wherein the first node type comprises one of users, places, pages, groups, posts, images, videos, applications, or events.
12. The media of claim 10 , wherein the static rank is independent of the query.
13. The media of claim 10 , wherein the value is calculated according to a pre-determined ranking criteria, and wherein different search indices have different ranking criteria.
14. The media of claim 10 , wherein the sub-values are calculated based on, for each of one or more edge types connected to the node:
determining an number of edges of the edge type connected to the node; and
multiplying the number of edges of the edge type by a weight corresponding to the edge type.
15. The media of claim 10 , wherein the search indices are stored within a social-networking system.
16. The media of claim 10 , further comprising:
accessing the social graph, wherein the social graph comprises a plurality of nodes and a plurality of edges connecting the nodes, the nodes comprising:
a first node corresponding to the first user; and
plurality of second nodes corresponding to a plurality of objects, respectively, each object being of a particular object type.
17. The media of claim 10 , where in the search-results interface is a user interface of a native application associated with an online social network on a client device of the first user.
18. The media of claim 10 , wherein the search-results interface is a webpage of an online social network accessed by a browser client of the client device of the first user.
19. 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, from a client device of a first user, a query corresponding to a first node type of a plurality of node types;
search one or more search indices to identify one or more nodes of a social graph matching the query, wherein the search indices maintain an index of a plurality of nodes of the first node type, each node of the plurality of nodes having a static rank which is based at least in part on a pre-calculated value for each node, wherein the value is calculated based on one or more sub-values corresponding to one or more factors, respectively, wherein the factors comprise a number of edges of a particular edge type that are connected to the node or attributes of edges connected to the node; and
send, to the client device of the first user for display, a search-results interface responsive to the received query, the search-results interface comprising reference to one or more nodes each corresponding to the first node type and having a static rank greater than a threshold rank.