Name
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.dam.2015.11.003 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Fibonacci codes,Wavelet trees,Rank and select | Discrete mathematics,Data structure,Wavelet Tree,Fibonacci search technique,Mathematics,Random access,Variable-length code,Fibonacci number | Journal |
Volume | Issue | ISSN |
212 | C | 0166-218X |
Citations | PageRank | References |
6 | 0.50 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shmuel T. Klein | 1 | 434 | 77.80 |
| Dana Shapira | 2 | 144 | 32.15 |