English»Classic Information Retrieval»Dynamic & static pruning | searchivarius.org
log in | about 

Answering Top-k Queries Using Views  Gautam Das, Dimitrios Gunopulos, Nick Koudas
Dynamic Index Pruning for Effective Caching  Yohannes Tsegay, Andrew Turpin, Justin Zobel
Faster Top-k Document Retrieval Using Block-Max Indexes  S Ding, T Suel
Improving Web search efficiency via a locality based static pruning method  Edleno S. de Moura, Célia F. dos Santos, Daniel R. Fernandes, Altigran S. Silva, Pavel Calado, Mario A. Nascimento
Index Pruning and Result Reranking: Effects on Ad­Hoc Retrieval and Named Page Finding  Stefan, Büttcher, Charles L. A., Clarke Peter, C. K. Yeung
Multi-Tier Architecture for Web Search Engines  KM Risvik, Y Aasheim, M Lidal
Optimization of inverted vector searches  Chris Buckley, Alan F. Lewit
Optimized Query Execution in Large Search Engines with Global Page Ordering  Xiaohui Long, Torsten Suel
Pruned Query Evaluation Using Pre-Computed Impacts  Ngoc Anh, Alistair Moffat
Pruning Policies for Two-Tiered Inverted Index with Correctness Guarantee  Alexandros Ntoulas, Junghoo Cho
Query evaluation: strategies and optimizations  Howard Turtle, James Flood
Static Index Pruning for Information Retrieval Systems  David Carmel, Doron Cohen, Ronald Fagin, Eitan Farchi, Michael Herscovici, Yoelle S. Maarek, Aya Soffer - One of the first papers on static (vs. dynamic) index pruning.