Document Type
Conference Proceeding
Publication Date
7-4-2012
Abstract
Let {d 1,d 2,...d D } be a given set of D string documents of total length n, our task is to index , such that the k most relevant documents for an online query pattern P of length p can be retrieved efficiently. We propose an index of size |CSA| + nlogD(2 + o(1)) bits and O(t s (p) + kloglogn + polyloglogn) query time for the basic relevance metric term-frequency, where |CSA| is the size (in bits) of a compressed full text index of , with O(t s (p)) time for searching a pattern of length p. We further reduce the space to |CSA| + nlogD(1 + o(1)) bits, however the query time will be O(t s (p) + k(logσloglogn) 1 + ε + polyloglogn), where σ is the alphabet size and ε > 0 is any constant. © 2012 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
173
Last Page
184
Recommended Citation
Hon, W., Shah, R., & Thankachan, S. (2012). Towards an optimal space-and-query-time index for top-k document retrieval. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7354 LNCS, 173-184. https://doi.org/10.1007/978-3-642-31265-6_14
