A Space Efficient Direct Access Data Structure

Gilad Baruch, Shmuel T. Klein, Dana Shapira

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


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.

Original languageEnglish
Title of host publicationProceedings - DCC 2016
Subtitle of host publication2016 Data Compression Conference
EditorsMichael W. Marcellin, Ali Bilgin, Joan Serra-Sagrista, James A. Storer
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages10
ISBN (Electronic)9781509018536
StatePublished - 15 Dec 2016
Event2016 Data Compression Conference, DCC 2016 - Snowbird, United States
Duration: 29 Mar 20161 Apr 2016

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314


Conference2016 Data Compression Conference, DCC 2016
Country/TerritoryUnited States


  • Skeleton Huffman Trees
  • Succinct Data Structures
  • Wavelet Tree


Dive into the research topics of 'A Space Efficient Direct Access Data Structure'. Together they form a unique fingerprint.

Cite this