Top-k document retrieval in external memory
Document Type
Conference Proceeding
Publication Date
9-24-2013
Abstract
Let D be a given set of (string) documents of total length n. The top-k document retrieval problem is to index D such that when a pattern P of length p, and a parameter k come as a query, the index returns those k documents which are most relevant to P. We present the first non-trivial external memory index supporting top-k document retrieval queries in optimal O(p/B+logB n+k/B) I/Os, where B is the block size. The index space is almost linear O(n log* n) words. © 2013 Springer-Verlag.
Publication Source (Journal or Book title)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
First Page
803
Last Page
814
Recommended Citation
Shah, R., Sheng, C., Thankachan, S., & Vitter, J. (2013). Top-k document retrieval in external memory. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8125 LNCS, 803-814. https://doi.org/10.1007/978-3-642-40450-4_68
