@inproceedings{c10d128488dd4c7f82b60abcffb1eda5,
title = "A Space Efficient Direct Access Data Structure",
abstract = "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{\"u}lekci, DACs and sampling, with a slowdown as compared to DACs and fixed length encoding.",
keywords = "Skeleton Huffman Trees, Succinct Data Structures, Wavelet Tree",
author = "Gilad Baruch and Klein, \{Shmuel T.\} and Dana Shapira",
note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 Data Compression Conference, DCC 2016 ; Conference date: 29-03-2016 Through 01-04-2016",
year = "2016",
month = dec,
day = "15",
doi = "10.1109/dcc.2016.61",
language = "الإنجليزيّة",
series = "Data Compression Conference Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "63--72",
editor = "Marcellin, \{Michael W.\} and Ali Bilgin and Joan Serra-Sagrista and Storer, \{James A.\}",
booktitle = "Proceedings - DCC 2016",
address = "الولايات المتّحدة",
}