Abstract
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 language | English |
|---|---|
| Title of host publication | Proceedings of the Prague Stringology Conference, PSC 2017 |
| Editors | Jan Holub, Jan Zdarek |
| Publisher | Prague Stringology Club |
| Pages | 18-29 |
| Number of pages | 12 |
| ISBN (Electronic) | 9788001061930 |
| State | Published - 2017 |
| Event | 21st Prague Stringology Conference, PSC 2017 - Prague, Czech Republic Duration: 28 Aug 2017 → 30 Aug 2017 |
Publication series
| Name | Proceedings of the Prague Stringology Conference, PSC 2017 |
|---|
Conference
| Conference | 21st Prague Stringology Conference, PSC 2017 |
|---|---|
| Country/Territory | Czech Republic |
| City | Prague |
| Period | 28/08/17 → 30/08/17 |
Bibliographical note
Publisher Copyright:© Czech Technical University in Prague, Czech Republic.