In previous work we have suggested a data structure based on pruning a Huffman shaped Wavelet tree according to the underlying skeleton Huffman tree. This pruned Wavelet tree was especially designed to support faster random access and save memory storage, at the price of less effective rank and select operations, as compared to the original Huffman shaped Wavelet tree. In this paper we improve the pruning procedure and give empirical evidence that when memory storage is of main concern, our suggested data structure outperforms other direct access techniques such as those due to Külekci, DACs and sampling, with a slowdown as compared to DACs and fixed length encoding.
|Title of host publication
|Proceedings - DCC 2016
|Subtitle of host publication
|2016 Data Compression Conference
|Michael W. Marcellin, Ali Bilgin, Joan Serra-Sagrista, James A. Storer
|Institute of Electrical and Electronics Engineers Inc.
|Number of pages
|Published - 15 Dec 2016
|2016 Data Compression Conference, DCC 2016 - Snowbird, United States
Duration: 29 Mar 2016 → 1 Apr 2016
|Data Compression Conference Proceedings
|2016 Data Compression Conference, DCC 2016
|29/03/16 → 1/04/16
Bibliographical notePublisher Copyright:
© 2016 IEEE.
- Skeleton Huffman Trees
- Succinct Data Structures
- Wavelet Tree