作者: Matthias Hagen , Benno Stein
DOI: 10.1109/DEXA.2010.29
关键词:
摘要: Given a set of keywords, we find maximum Web query (containing the most keywords possible) that respects user-defined bounds on number returned hits. We assume real-world setting where user is not given direct access to search engine's index, i.e., querying possible only through an interface. The goal be optimized overall submitted queries. One original contribution our research formalization and theoretical foundation problem. But, in particular, develop co-occurrence probability informed strategy for performance gain achieved with approach substantial: compared uninformed baseline (without information) expected savings are up 20% queries runtime.