10. In a computing environment, a system comprising: at least one processing unit; a transformation mechanism, implemented on the at least one processing unit, configured to process a search log, including by determining which queries from the search log correspond to information that is safe to publish, and for each of the queries having information that is safe to publish, configured to publish the information as output data, wherein determining which queries from the search log correspond to information that is safe to publish comprises limiting how many queries in the search log each user can contribute to a set of queries for processing, wherein publishing the information as output data comprises outputting a query-action graph having nodes representing queries and nodes representing actions taken, with each edge between a query node and an action node having a weight that indicates how many times that action was taken following that query, wherein the weight has zero noise, a negative noise or a positive noise added thereto, or outputting a query-inaction graph having nodes representing queries and nodes representing actions skipped, with each edge between a query node and an inaction node having a weight that indicates how many times that action was not taken following that query, and wherein the weight has zero noise, a negative noise or a positive noise added thereto.
10. In a computing environment, a system comprising: at least one processing unit; a transformation mechanism, implemented on the at least one processing unit, configured to process a search log, including by determining which queries from the search log correspond to information that is safe to publish, and for each of the queries having information that is safe to publish, configured to publish the information as output data, wherein determining which queries from the search log correspond to information that is safe to publish comprises limiting how many queries in the search log each user can contribute to a set of queries for processing, wherein publishing the information as output data comprises outputting a query-action graph having nodes representing queries and nodes representing actions taken, with each edge between a query node and an action node having a weight that indicates how many times that action was taken following that query, wherein the weight has zero noise, a negative noise or a positive noise added thereto, or outputting a query-inaction graph having nodes representing queries and nodes representing actions skipped, with each edge between a query node and an inaction node having a weight that indicates how many times that action was not taken following that query, and wherein the weight has zero noise, a negative noise or a positive noise added thereto. 16. The system of claim 10 wherein the transformation mechanism is further configured to output a query reformulation graph having nodes representing queries and nodes representing reformulated queries, with each edge between a query node and reformulated query node having a weight that indicates how many times that reformulated query was clicked on following that query, wherein the weight has zero noise, a negative noise or a positive noise added thereto.