Compressed Document Retrieval on String Collections

Years and Authors of Summarized Original Work

• 2009; Hon, Shah, Vitter

• 2013; Belazzougui, Navarro, Valenzuela

• 2013; Tsur

• 2014; Hon, Shah, Thankachan, Vitter

• 2014; Navarro, Thankachan

Problem Definition

We face the following problem.

Problem 1 (Top-k document retrieval)

Let$\mathcal{D} =\{ \mathsf{T}_{1},\mathsf{T}_{2},\ldots ,\mathsf{T}_{D}\}$be a collection of D documents of n characters in total, drawn from an alphabet set Σ = [σ]. The relevance of a documentT_dwith respect to a pattern P, denoted by w(P,d) is a function of the set of occurrences of P inT_d. Our task is to index$\mathcal{D}$, such that whenever a pattern P[1,p] and a parameter k comes as a query, the k documents with the highest w(P,⋅) values can be reported efficiently.

Compressed Document Retrieval on String Collections, Table 1 Indexes of space $2\vert \mathsf{CSA}\vert + D\log (n/D) + O(D) + o(n)$ bits