On the Cost of Negation for Dynamic Pruning

No abstract is available for this paper.

• Publication year

  2018

• Venue

  European Conference on Information Retrieval

• Publication date

  2018-03-26

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-319-76941-7_42
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient & Effective Selective Query Rewriting with Efficiency Predictions

  2017cited by this paper
• Faster BlockMax WAND with Variable-sized Blocks

  2017cited by this paper
• A Comparison of Document-at-a-Time and Score-at-a-Time Query Evaluation

  2017cited by this paper
• Exploring the magic of WAND

  2013cited by this paper
• The whens and hows of learning to rank for web search

  2012cited by this paper
• Earlybird: Real-Time Search at Twitter

  2012cited by this paper
• Faster top-k document retrieval using block-max indexes

  2011influential reference
• Automatic boolean query suggestion for professional search

  2011cited by this paper
• Generating query substitutions

  2006cited by this paper
• Optimization strategies for complex queries

  2005cited by this paper
• Efficient query evaluation using a two-level retrieval process

  2003influential reference
• Searching the Web: the public and their queries

  2001cited by this paper
• Searching the Web

  2001cited by this paper
• Query Evaluation: Strategies and Optimizations

  1995cited by this paper

• Anytime Ranking on Document-Ordered Indexes

  2021cites this paper