Self-indexing inverted files for fast text retrieval
ACM Transactions on Information Systems (TOIS)
Efficient query evaluation using a two-level retrieval process
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Toward better weighting of anchors
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Proceedings of the 2009 workshop on Web Search Click Data
Second ACM International Conference on Web Search and Web Data Mining
Search Engines: Information Retrieval in Practice
Search Engines: Information Retrieval in Practice
Efficient processing of complex features for information retrieval
Efficient processing of complex features for information retrieval
Upper-bound approximations for dynamic pruning
ACM Transactions on Information Systems (TOIS)
Towards efficient indexing of arbitrary similarity: vision paper
ACM SIGMOD Record
| Hi-index | 0.00 |
Dynamic pruning strategies enhance the efficiency of search engines, by making use of term upper bounds to decide when a document will not make the final set of k retrieved documents. After discussing different approaches for obtaining term upper bounds, we propose the use of multiple least upper bounds. Experiments are conducted on the TREC ClueWeb09 corpus, to measure the accuracy of different upper bounds.