17. A non-transitory computer-readable storage medium storing computer code for searching content, said computer code upon execution performing: maintaining a log of queries; dividing said queries into individual query terms; analyzing said queries and partitioning the individual query terms into collections based on co-occurrence of the individual query terms within the queries, wherein co-occurrence of given ones of the individual query terms in a particular one of the queries comprises the given individual query terms co-occurring in a particular query; representing said query terms as nodes within a construct, with edges connecting the nodes, wherein each of said edges is assigned a frequency weight for representing co-occurrence in the queries of query terms represented by the nodes connected by a corresponding edge; partitioning said construct into sets based on said edges; distributing linking indices for the query terms to different index servers, depending upon the sets in which said query terms are located; maintaining a map indicating which of the index servers store corresponding ones of the linking indices for individual query terms; and distributing query terms in a new query to the index servers based on said map.
17. A non-transitory computer-readable storage medium storing computer code for searching content, said computer code upon execution performing: maintaining a log of queries; dividing said queries into individual query terms; analyzing said queries and partitioning the individual query terms into collections based on co-occurrence of the individual query terms within the queries, wherein co-occurrence of given ones of the individual query terms in a particular one of the queries comprises the given individual query terms co-occurring in a particular query; representing said query terms as nodes within a construct, with edges connecting the nodes, wherein each of said edges is assigned a frequency weight for representing co-occurrence in the queries of query terms represented by the nodes connected by a corresponding edge; partitioning said construct into sets based on said edges; distributing linking indices for the query terms to different index servers, depending upon the sets in which said query terms are located; maintaining a map indicating which of the index servers store corresponding ones of the linking indices for individual query terms; and distributing query terms in a new query to the index servers based on said map. 18. The non-transitory computer-readable storage medium as set forth in claim 17 wherein said partitioning further takes into account how often the terms are found in the content.