Context-sensitive ranking for document retrieval

We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by domain-interested users. The motivation of context-sensitive search is that the ranking of the same keyword query generally depends on the context. The reason is that the underlying keyword statistics differ significantly from one context to another. The query evaluation challenge is the computation of keyword statistics at runtime, which involves expensive online aggregations. We appropriately leverage and extend materialized view research in order to deliver algorithms and data structures that evaluate context-sensitive queries efficiently. Specifically, a number of views are selected and materialized, each corresponding to one or more large contexts. Materialized views are used at query time to compute statistics which are used to compute ranking scores. Experimental results show that the contextsensitive ...

• Type: Journal
• Year: 2011
• Where: SIGMOD
• Authors: Liang Jeff Chen, Yannis Papakonstantinou
• Keywords: Algorithms And Data Structures, Database, Database Management Systems, Information Storage And Retrieval, SIGMOD 2011