Sciweavers

Share
DEXAW
2010
IEEE

Search Strategies for Keyword-based Queries

10 years 3 months ago
Search Strategies for Keyword-based Queries
Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects userdefined bounds on the number of returned hits. We assume a real-world setting where the user is not given direct access to a Web search engine's index, i.e., querying is possible only through an interface. The goal to be optimized is the overall number of submitted Web queries. One original contribution of our research is the formalization and theoretical foundation of the problem. But, in particular, we develop a co-occurrence probability informed search strategy for the problem. The performance gain achieved with our approach is substantial: compared to the uninformed baseline (without cooccurrence information) the expected savings are up to 20% in the number of submitted queries and runtime. Keywords-Web Search, Query Formulation, Search Cost Optimization, Maximum Query, Long Query Reduction
Matthias Hagen, Benno Stein
Added 08 Nov 2010
Updated 08 Nov 2010
Type Conference
Year 2010
Where DEXAW
Authors Matthias Hagen, Benno Stein
Comments (0)
books