Exploiting Available Memory and Disk for Scalable Instant Overview Search

Search-As-You-Type (or Instant Search) is a recently introduced functionality which shows predictive results while the user types a query letter by letter. In this paper we generalize and propose an extension of this technique which apart from showing on-the-fly the first page of results, it shows various other kinds of information, e.g. the outcome of results clustering techniques, or metadata-based groupings of the results. Although this functionality is more informative than the classic search-as-you type, since it combines Autocompletion, Search-As-You-Type, and Results Clustering, the provision of real-time interaction is more challenging. To tackle this issue we propose an approach based on pre-computed information and we comparatively evaluate various index structures for making real-time interaction feasible, even if the size of the available memory space is limited. This comparison reveals the memory/ performance trade-off and allows deciding which index structure to use according to the available main memory and desired performance. Furthermore we show that an incremental algorithm can be used to keep the index structure fresh.

[1]  Guoliang Li,et al.  Efficient type-ahead search on relational data: a TASTIER approach , 2009, SIGMOD Conference.

[2]  Panagiotis G. Ipeirotis,et al.  Automatic construction of multifaceted browsing interfaces , 2005, CIKM '05.

[3]  Gottfried Vossen,et al.  Web Information Systems Engineering - WISE 2009, 10th International Conference, Poznan, Poland, October 5-7, 2009. Proceedings , 2009, WISE.

[4]  Yannis Tzitzikas,et al.  Exploratory Web Searching with Dynamic Taxonomies and Results Clustering , 2009, ECDL.

[5]  Guoliang Li,et al.  Efficient interactive fuzzy keyword search , 2009, WWW '09.

[6]  Gustavo Rossi,et al.  Web Engineering , 2001, Lecture Notes in Computer Science.

[7]  Guoliang Li,et al.  Interactive search in XML data , 2009, WWW '09.

[8]  Xiaoyan Gu,et al.  Efficient Interactive Smart Keyword Search , 2010, WISE.

[9]  Stuart Macdonald,et al.  User Engagement in Research Data Curation , 2009, ECDL.

[10]  Yinglian Xie,et al.  Locality in search engine queries and its implications for caching , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Vagelis Hristidis,et al.  FACeTOR: cost-driven exploration of faceted query results , 2010, CIKM.

[12]  Ingmar Weber,et al.  Type less, find more: fast autocompletion search with a succinct index , 2006, SIGIR.

[13]  Mukesh K. Mohania,et al.  Retrieval]: Query formulation, search process , 2022 .

[14]  Hao Wu,et al.  Seaform: Search-As-You-Type in Forms , 2010, Proc. VLDB Endow..

[15]  Yannis Tzitzikas,et al.  Advancing Search Query Autocompletion Services with More and Better Suggestions , 2010, ICWE.

[16]  Torsten Suel,et al.  Web Information Systems Engineering - WISE 2010 - 11th International Conference, Hong Kong, China, December 12-14, 2010. Proceedings , 2010, WISE.

[17]  Fabian M. Suchanek,et al.  ESTER: efficient search on text, entities, and relations , 2007, SIGIR.

[18]  T. H. Merrett,et al.  Tries for Approximate String Matching , 1996, IEEE Trans. Knowl. Data Eng..

[19]  Yannis Tzitzikas,et al.  STC+ and NM-STC: Two Novel Online Results Clustering Methods for Web Searching , 2009, WISE.

[20]  Monika Henzinger,et al.  Analysis of a very large web search engine query log , 1999, SIGF.