Abstract
Let D = {d1, d2,... dD} be a given set of D string documents of total length n. Our task is to index D such that the k most relevant documents for an online query pattern P of length p can be retrieved efficiently. There exist linear space data structures of O(n) words for answering such queries in optimal O(p + k) time. In this paper, we describe a compact index of size |CSA| + n lg D + o(n lg D) bits with near optimal time, O(p + k lg* n), for the basic relevance metric term-frequency, where |CSA| is the size (in bits) of a compressed full-text index of D, and lg* n is the iterated logarithm of n. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Navarro, G., & Thankachan, S. V. (2013). Top-k document retrieval in compact space and near-optimal time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8283 LNCS, pp. 394–404). https://doi.org/10.1007/978-3-642-45030-3_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
