Sciweavers

CORR
2010
Springer

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

12 years 10 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
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.
Jérémy Barbay, Johannes Fischer
Added 14 May 2011
Updated 14 May 2011
Type Journal
Year 2010
Where CORR
Authors Jérémy Barbay, Johannes Fischer
Comments (0)