Range queries using Huffman wavelet trees

Gilad Baruch, Shmuel T. Klein, Dana Shapira

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


A Wavelet Tree (WT) is a compact data structure which is used in order to perform various well defined operations directly on the compressed form of a file. Many algorithms that are based on WTs consider balanced binary trees as their shape. However, when non uniform repetitions occur in the underlying data, it may be better to use a Huffman structure, rather than a balanced tree, improving both storage and average processing time. We study distinct range queries and several related problems that may benefit from this change and present theoretical and empirical improvements in time and space complexities.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference, PSC 2017
EditorsJan Holub, Jan Zdarek
Number of pages12
ISBN (Electronic)9788001061930
StatePublished - 2017
Event21st Prague Stringology Conference, PSC 2017 - Prague, Czech Republic
Duration: 28 Aug 201730 Aug 2017

Publication series

NameProceedings of the Prague Stringology Conference, PSC 2017


Conference21st Prague Stringology Conference, PSC 2017
Country/TerritoryCzech Republic


Dive into the research topics of 'Range queries using Huffman wavelet trees'. Together they form a unique fingerprint.

Cite this