Fast top-k preserving query processing using two-tier indexes-Reference-Cited by-同舟云学术

Fast top-k preserving query processing using two-tier indexes

Published:2016-09 Issue:5 Volume:52 Page:855-872
ISSN:0306-4573
Container-title:Information Processing & Management
language:en
Short-container-title:Information Processing & Management

Author:

Daoud Caio Moura,Silva de Moura Edleno,Carvalho Andre,Soares da Silva Altigran,Fernandes David,Rossi Cristian

Funder

CAPES

CNPq

Publisher

Elsevier BV

Subject

Library and Information Sciences,Management Science and Operations Research,Computer Science Applications,Media Technology,Information Systems

Reference21 articles.

1. Pruned query evaluation using pre-computed impacts;Anh,2006

2. Vector-space ranking with effective early termination;Anh,2001

3. Modern information retrieval;Baeza-Yates,2011

4. Efficient query evaluation using a two-level retrieval process;Broder,2003

5. LeprEF: Learn to pre-compute evidence fusion for efficient query evaluation;Carvalho;Journal of the Association for Information Science and Technology,2012

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

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

2. Efficient immediate-access dynamic indexing;Information Processing & Management;2023-05

3. An NVM SSD-based High Performance Query Processing Framework for Search Engines;IEEE Transactions on Knowledge and Data Engineering;2022

4. Window Navigation with Adaptive Probing for Executing BlockMax WAND;Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval;2021-07-11

5. Examining the Additivity of Top-k Query Processing Innovations;Proceedings of the 29th ACM International Conference on Information & Knowledge Management;2020-10-19