Skip to main content
Article thumbnail
Location of Repository

LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations ⋆

By Jérémy Barbay, Johannes Fischer and Gonzalo Navarro

Abstract

Abstract. LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a previous block. They were used to encode ordinal trees and to index integer arrays in order to support range minimum queries on them. We describe how they yield many other convenient results in a variety of areas: compressed succinct indices for range minimum queries on partially sorted arrays; a new adaptive sorting algorithm; and a compressed succinct data structure for permutations supporting direct and inverse application in time inversely proportional to the permutation’s compressibility.

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.1759
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://users.dcc.uchile.cl/~jb... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.