摘要: We tackle problems related to Web query formulation: given the set of keywords from a search session, 1) we find maximum promising query, and, 2) construct family queries covering all keywords. A is if it fulfills user-defined constraints on number returned hits. assume real-world setting where user not direct access engine's index, i.e., querying possible only through an interface. The goal be optimized overall submitted queries. For both develop strategies based co-occurrence probabilities. achieved performance gain substantial: compared uninformed baselines without probabilities expected savings are up 50% in queries, index accesses, and runtime.