Abstract
A Wavelet tree is a data structure adjoined to a file that has been compressed by a variable length encoding, which allows direct access to the underlying file, resulting in the fact that the compressed file is not needed any more. We adapt, in this paper, the Wavelet tree to Fibonacci codes, so that in addition to supporting direct access to the Fibonacci encoded file, we also increase the compression savings when compared to the original Fibonacci compressed file. The improvements are achieved by means of a new pruning technique.
Original language | English |
---|---|
Pages (from-to) | 115-128 |
Number of pages | 14 |
Journal | Discrete Applied Mathematics |
Volume | 212 |
DOIs | |
State | Published - 30 Oct 2016 |
Keywords
- Fibonacci codes
- Rank and select
- Wavelet trees
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Applied Mathematics