Negated query terms allow documents containing such terms to be filtered out of a search results list, supporting disambiguation. In this work, the effect of negation on the efficiency of disjunctive, top-k retrieval is examined. First, we show how negation can be integrated efficiently into two popular dynamic pruning algorithms. Then, we explore the efficiency of our approach, and show that while often efficient, negation can negatively impact the dynamic pruning effectiveness for certain queries
Static index pruning techniques permanently remove a presumably redundant part of an inverted file, ...
Modern retrieval approaches apply not just single-term weighting models when ranking documents - ins...
Search engines are exceptionally important tools for accessing information in today’s world. In sati...
Negated query terms allow documents containing such terms to be filtered out of a search results lis...
Dynamic pruning strategies enhance the efficiency of search engines, by making use of term upper bou...
Retrieval can be made more efficient by deploying dynamic pruning strategies such as WAND, which do ...
Dynamic pruning strategies are effective yet permit efficient retrieval by pruning - i.e. not fully ...
Evaluation of ranked queries on large text collections can be costly in terms of processing time and...
Document-at-a-time (DAAT) dynamic pruning strategies for information retrieval systems such as MaxSc...
Recent advances in dense retrieval techniques have offered the promise of being able not just to re-...
This paper shows that any non-repeating conjunctive rela-tional query with negation has either polyn...
Carterette, BenStatic index pruning methods have been proposed to reduce the index size of informati...
The Web search engines maintain large-scale inverted indexes which are queried thousands of times pe...
Static index pruning techniques permanently remove a presumably redundant part of an inverted file, ...
Processing top-k bag-of-words queries is critical to many information retrieval applications, includ...
Static index pruning techniques permanently remove a presumably redundant part of an inverted file, ...
Modern retrieval approaches apply not just single-term weighting models when ranking documents - ins...
Search engines are exceptionally important tools for accessing information in today’s world. In sati...
Negated query terms allow documents containing such terms to be filtered out of a search results lis...
Dynamic pruning strategies enhance the efficiency of search engines, by making use of term upper bou...
Retrieval can be made more efficient by deploying dynamic pruning strategies such as WAND, which do ...
Dynamic pruning strategies are effective yet permit efficient retrieval by pruning - i.e. not fully ...
Evaluation of ranked queries on large text collections can be costly in terms of processing time and...
Document-at-a-time (DAAT) dynamic pruning strategies for information retrieval systems such as MaxSc...
Recent advances in dense retrieval techniques have offered the promise of being able not just to re-...
This paper shows that any non-repeating conjunctive rela-tional query with negation has either polyn...
Carterette, BenStatic index pruning methods have been proposed to reduce the index size of informati...
The Web search engines maintain large-scale inverted indexes which are queried thousands of times pe...
Static index pruning techniques permanently remove a presumably redundant part of an inverted file, ...
Processing top-k bag-of-words queries is critical to many information retrieval applications, includ...
Static index pruning techniques permanently remove a presumably redundant part of an inverted file, ...
Modern retrieval approaches apply not just single-term weighting models when ranking documents - ins...
Search engines are exceptionally important tools for accessing information in today’s world. In sati...