The Fast Fibonacci Decompression Algorithm
| dc.creator | Baca, R. | |
| dc.creator | Snasel, V. | |
| dc.creator | Platos, J. | |
| dc.creator | Kratky, M. | |
| dc.creator | El-Qawasmeh, E. | |
| dc.date | 2007-12-05 | |
| dc.date | 2007-12-19 | |
| dc.date.accessioned | 2026-07-07T08:50:00Z | |
| dc.date.available | 2026-07-07T08:50:00Z | |
| dc.description | Data compression has been widely applied in many data processing areas. Compression methods use variable-size codes with the shorter codes assigned to symbols or groups of symbols that appear in the data frequently. Fibonacci coding, as a representative of these codes, is used for compressing small numbers. Time consumption of a decompression algorithm is not usually as important as the time of a compression algorithm. However, efficiency of the decompression may be a critical issue in some cases. For example, a real-time compression of tree data structures follows this issue. Tree's pages are decompressed during every reading from a secondary storage into the main memory. In this case, the efficiency of a decompression algorithm is extremely important. We have developed a Fast Fibonacci decompression for this purpose. Our approach is up to $3.5\times$ faster than the original implementation. | |
| dc.identifier | https://arxiv.org/abs/0712.0811 | |
| dc.identifier | http://arxiv.org/abs/0712.0811 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/144473 | |
| dc.subject | Performance | |
| dc.subject | Other Computer Science | |
| dc.title | The Fast Fibonacci Decompression Algorithm | |
| dc.type | text |