On Optimal Top-K String Retrieval

Rahul Shah, Cheng Sheng, Sharma V. Thankachan +1

Let $\mathcal{D}$ = $\{d_1,d_2,d_3,...,d_D\}$ be a given set of $D$ (string) documents of total length $n$. The top-$k$ document retrieval problem is to index $\mathcal{D}$ such that…