Practical Top-K Document Retrieval in Reduced Space
Data Structures and Algorithms
2011-11-21 v1
Abstract
Supporting top-k document retrieval queries on general text databases, that is, finding the k documents where a given pattern occurs most frequently, has become a topic of interest with practical applications. While the problem has been solved in optimal time and linear space, the actual space usage is a serious concern. In this paper we study various reduced-space structures that support top-k retrieval and propose new alternatives. Our experimental results show that our novel algorithms and data structures dominate almost all the space/time tradeoff.
Cite
@article{arxiv.1111.4395,
title = {Practical Top-K Document Retrieval in Reduced Space},
author = {Gonzalo Navarro and Daniel Valenzuela},
journal= {arXiv preprint arXiv:1111.4395},
year = {2011}
}