A Comparison of Document-at-a-Time and Score-at-a-Time Query Evaluation-Reference-Cited by-同舟云学术

A Comparison of Document-at-a-Time and Score-at-a-Time Query Evaluation

Published:2017-02-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Tenth ACM International Conference on Web Search and Data Mining
language:
Short-container-title:

Author:

Crane Matt¹,Culpepper J. Shane²,Lin Jimmy¹,Mackenzie Joel²,Trotman Andrew³

Affiliation:

1. University of Waterloo, Waterloo, ON, Canada

2. RMIT University, Melbourne, Australia

3. University of Otago, Dunedin, New Zealand

Funder

Australian Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3018661.3018726

Reference36 articles.

1. Pruned query evaluation using pre-computed impacts

2. V. N. Anh and A. Moffat. Inverted index compression using word-aligned binary codes. Software:\ Practice and Experience 40 (2): 131--147 2010. V. N. Anh and A. Moffat. Inverted index compression using word-aligned binary codes. Software:\ Practice and Experience 40 (2): 131--147 2010.

3. Vector-space ranking with effective early termination

4. Effectiveness/efficiency tradeoffs for candidate generation in multi-stage retrieval architectures

5. UQV100

Cited by 43 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bridging Dense and Sparse Maximum Inner Product Search;ACM Transactions on Information Systems;2024-08-19

2. Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations;Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval;2024-07-10

3. An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors;ACM Transactions on Information Systems;2023-11-08

4. Profiling and Visualizing Dynamic Pruning Algorithms;Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval;2023-07-18

5. Many are Better than One: Algorithm Selection for Faster Top-K Retrieval;Information Processing & Management;2023-07