1. A computer-implemented method, comprising: identifying a first query and a second query in a query log; identifying a set of overlapping predicate queries for the first query and the second query, the set of overlapping predicate queries being a set of predicate queries for the first query that are also predicate queries for the second query; identifying, by one or more computers, an intersection set size associated with an intersection set of a first set of predicate queries comprising queries that have immediately preceded the first query in associated sessions and a second set of predicate queries comprising queries that have immediately preceded the second query in associated sessions, the intersection set thereby defining the set of overlapping predicate queries; identifying, by one or more computers, a union set size associated with a union set of the first set of predicate queries and the second set of predicate queries; and assigning, by one or more computers, a quotient of the intersection set size over the union set size as a query intersect frequency for the first query and the second query; determining a query map value for the first query and the second query, the query map value being determined from the set of overlapping predicate queries and comprising the query intersect frequency; determining that the query map value exceeds a threshold; and in response to determining that the query map value exceeds the threshold, identifying the first query as a query suggestion for the second query and the second query as a query suggestion for the first query.
7. The computer-implemented method of claim 1 , wherein the determining if the query map value exceeds a threshold comprises determining that the first and second queries are related based upon the first and second queries being associated with a group of predicate queries having at least a threshold query map value.