Top-k document retrieval in optimal space

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


We present an index for top-k most frequent document retrieval whose space is |CSA|+o(n)+DlognD+O(D) bits, and its query time is O(logklog2 +Ïμn) per reported document, where D is the number of documents, n is the sum of lengths of the documents, and |CSA| is the space of the compressed suffix array for the documents. This improves over previous results for this problem, whose space complexities are |CSA|+ω(n) or 2|CSA|+ω(1).

Original languageEnglish
Pages (from-to)440-443
Number of pages4
JournalInformation Processing Letters
Issue number12
StatePublished - 17 Apr 2013


  • Data structures
  • Document retrieval
  • Text indexing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Top-k document retrieval in optimal space'. Together they form a unique fingerprint.

Cite this