Efficient Interactive Smart Keyword Search

Li, Shijun; Yu, Wei; Xiao-yan, GU; Jiang, Huifu; Fang, Chuanyun

doi:10.1007/978-3-642-17616-6_19

Cited by 1 publication

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are several works describing letter-by-letter searching for various kinds of sources, e.g. for relational databases [5,15,10,11], or documents [2,9]. To cope with the efficiency problem, most use pre-computed results and in-memory indexes (i.e.…”

Section: Background and Related Workmentioning

confidence: 99%

Exploiting Available Memory and Disk for Scalable Instant Overview Search

Fafalios

Tzitzikas

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. 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-AsYou-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.

show abstract