Context-sensitive ranking for document retrieval
Authors:
Open Access
- 12 June 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 757-768
Abstract
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 context-sensitive ranking generally improves the ranking quality, while our materialized view-based technique improves the query efficiency.Keywords
This publication has 25 references indexed in Scilit:
- TREC genomics special issue overviewInformation Retrieval Journal, 2008
- Evaluation of query expansion using MeSH in PubMedInformation Retrieval Journal, 2008
- Dynamic personalized pagerank in entity-relation graphs2007
- Interest-based personalized searchACM Transactions on Information Systems, 2007
- Improved approximation algorithms for minimum-weight vertex separators2005
- Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree ApproachData Mining and Knowledge Discovery, 2004
- A formal perspective on the view selection problemThe VLDB Journal, 2002
- Topic-sensitive PageRank2002
- Scalable algorithms for association miningIEEE Transactions on Knowledge and Data Engineering, 2000
- Finding good approximate vertex and edge partitions is NP-hardInformation Processing Letters, 1992