TY - GEN
T1 - Range queries using Huffman wavelet trees
AU - Baruch, Gilad
AU - Klein, Shmuel T.
AU - Shapira, Dana
N1 - Publisher Copyright:
© Czech Technical University in Prague, Czech Republic.
PY - 2017
Y1 - 2017
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85086067264&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85086067264
T3 - Proceedings of the Prague Stringology Conference, PSC 2017
SP - 18
EP - 29
BT - Proceedings of the Prague Stringology Conference, PSC 2017
A2 - Holub, Jan
A2 - Zdarek, Jan
T2 - 21st Prague Stringology Conference, PSC 2017
Y2 - 28 August 2017 through 30 August 2017
ER -