Asymptotically Optimal Encodings for Range Selection

Authors Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti

Thumbnail PDF


  • Filesize: 474 kB
  • 11 pages

Document Identifiers

Author Details

Gonzalo Navarro
Rajeev Raman
Srinivasa Rao Satti

Cite AsGet BibTex

Gonzalo Navarro, Rajeev Raman, and Srinivasa Rao Satti. Asymptotically Optimal Encodings for Range Selection. In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 29, pp. 291-301, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


We consider the problem of preprocessing an array A[1..n] to answer range selection and range top-k queries. Given a query interval [i..j] and a value k, the former query asks for the position of the k-th largest value in A[i..j], whereas the latter asks for the positions of all the k largest values in A[i..j]. We consider the encoding} version of the problem, where A is not available at query time, and an upper bound kappa on k, the rank that is to be selected, is given at construction time. We obtain data structures with asymptotically optimal size and query time on a RAM model with word size Theta(lg(n)): our structures use O(n*lg(kappa)) bits and answer range selection queries in time O(1+lg(k) / lg(lg(n))) and range top-k queries in time O(k), for any k <= kappa.
  • Data Structures
  • Order Statistics
  • Succinct Data Structures
  • Space-efficient Data Structures


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads