Using Conjunctions for Faster Disjunctive Top-k Queries-Reference-Cited by-同舟云学术

Using Conjunctions for Faster Disjunctive Top-k Queries

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

Author:

Siedlaczek Michał¹,Mallia Antonio¹,Suel Torsten¹

Affiliation:

1. New York University, New York, NY, USA

Funder

National Science Foundation

Amazon

Publisher

ACM

Link

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

Reference42 articles.

1. Taily

2. Paolo Boldi and Sebastiano Vigna . 2006. MG4J at TREC 2006 . In TREC . Paolo Boldi and Sebastiano Vigna. 2006. MG4J at TREC 2006. In TREC .

3. Efficient query evaluation using a two-level retrieval process

4. Interval-based pruning for top-k processing over compressed lists

5. Olivier Chapelle and Yi Chang . 2011 . Yahoo! learning to rank challenge overview . In Proceedings of the learning to rank challenge . 1--24 . Olivier Chapelle and Yi Chang. 2011. Yahoo! learning to rank challenge overview. In Proceedings of the learning to rank challenge . 1--24.

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

1. Improved Learned Sparse Retrieval with Corpus-Specific Vocabularies;Lecture Notes in Computer Science;2024

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

3. Efficient Document-at-a-Time and Score-at-a-Time Query Evaluation for Learned Sparse Representations;ACM Transactions on Information Systems;2022-12-15

4. A Sketch-based Index for Correlated Dataset Search;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05