Queries on LZ-Bounded Encodings
Data Structures and Algorithms
2014-12-03 v1
Abstract
We describe a data structure that stores a string in space similar to that of its Lempel-Ziv encoding and efficiently supports access, rank and select queries. These queries are fundamental for implementing succinct and compressed data structures, such as compressed trees and graphs. We show that our data structure can be built in a scalable manner and is both small and fast in practice compared to other data structures supporting such queries.
Cite
@article{arxiv.1412.0967,
title = {Queries on LZ-Bounded Encodings},
author = {Djamal Belazzougui and Travis Gagie and Paweł Gawrychowski and Juha Kärkkäinen and Alberto Ordóñez and Simon J. Puglisi and Yasuo Tabei},
journal= {arXiv preprint arXiv:1412.0967},
year = {2014}
}