Social static ranking for search

One or more computer-readable non-transitory storage media in one or more computing systems, the media embodying logic that is operable when executed to:

• assign each of a plurality of nodes of a graph of a social-networking system to one of a plurality of search indices, each search index corresponding to a node type, each node assigned to a search index comprising the node type that the search index corresponds to;
• for each search index:
• determine a value for each node assigned to the search index, wherein the value is calculated based at least in part on one or more factors, wherein the factors comprise a number of edges of a particular edge type that are connected to the node in the graph or attributes of edges connected to the node in the graph, and wherein the value comprises a combination of sub-values, each sub-value being calculated for one of a plurality of edge types connected to the node;
• and
• rank the nodes assigned to the search index based at least in part on their values;
• and
• provide the search indices for storage to facilitate responding to queries encompassing objects represented by the nodes assigned to the search indices.

A first computing system comprising:

• a memory comprising instructions executable by one or more processors;
• and
• the one or more processors coupled to the memory and operable to execute the instructions, the one or more processors being operable when executing the instructions to:
• assign each of a plurality of nodes of a graph of a social-networking system to one of a plurality of search indices, each search index corresponding to a node type, each node assigned to a search index comprising the node type that the search index corresponds to;
• for each search index:
• determine a value for each node assigned to the search index, wherein the value is calculated based at least in part on one or more factors, wherein the factors comprise a number of edges of a particular edge type that are connected to the node in the graph or attributes of edges connected to the node in the graph, and wherein the value comprises a combination of sub-values, each sub-value being calculated for one of a plurality of edge types connected to the node;
• and
• rank the nodes assigned to the search index based at least in part on their values;
• and
• provide the search indices for storage to facilitate responding to queries encompassing objects represented by the nodes assigned to the search indices.