Bit-Parallel Wavelet Tree Construction (Abstract)
Authors: 
Patrick Dinklage, 
Johannes Fischer, 
Florian Kurpicz, Jan-Philipp TarnowskiAuthors Info & Claims
Patrick Dinklage, Johannes Fischer, Florian Kurpicz, Jan-Philipp TarnowskiAuthors Info & ClaimsPages 37 - 38
Abstract
We present the fastest practical construction algorithms for Huffman-shaped wavelet trees, closing the gap between theory and practice by utilizing SIMD instructions.
References
[1]
M. A. Babenko, P. Gawrychowski, T. Kociumaka, and T. Starikovskaya. 2015. Wavelet Trees Meet Suffix Trees. In SODA. SIAM, 572--591. https://doi.org/10.1137/1.9781611973730.39
[2]
M. Ceregini, F. Kurpicz, and R. Venturini. 2024. Faster Wavelet Tree Queries. In DCC. IEEE, 223--232. https://doi.org/10.1109/DCC58796.2024.00030
[3]
F. Claude, G. Navarro, and A. O. Pereira. 2015. The Wavelet Matrix: An Efficient Wavelet Tree for Large Alphabets. Inf. Syst., Vol. 47 (2015), 15--32. https://doi.org/10.1016/j.is.2014.06.002
[4]
P. Dinklage, J. Ellert, J. Fischer, F. Kurpicz, and M. Löbel. 2021. Practical Wavelet Tree Construction. ACM J. Exp. Algorithmics, Vol. 26 (2021), 1.8:1--1.8:67. https://doi.org/10.1145/3457197
[5]
P. Dinklage, J. Fischer, F. Kurpicz, and J.-P. Tarnowski. 2023. Bit-Parallel (Compressed) Wavelet Tree Construction. In DCC. IEEE, 81--90. https://doi.org/10.1109/DCC55655.2023.00016
[6]
P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. 2007. Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms, Vol. 3, 2 (2007), 20. https://doi.org/10.1145/1240233.1240243
[7]
R. Grossi, A. Gupta, and J. S. Vitter. 2003. High-Order Entropy-Compressed Text Indexes. In SODA. ACM/SIAM, 841--850.
[8]
F. Kurpicz. 2022. Engineering Compact Data Structures for Rank and Select Queries on Bit Vectors. In SPIRE (Lecture Notes in Computer Science, Vol. 13617). Springer, 257--272. https://doi.org/10.1007/978--3-031--20643--6_19
[9]
J. Labeit, J. Shun, and G. E. Blelloch. 2017. Parallel lightweight wavelet tree, suffix array and FM-index construction. J. Discrete Algorithms, Vol. 43 (2017), 2--17. https://doi.org/10.1016/j.jda.2017.04.001
[10]
J. I. Munro, Y. Nekrich, and J S. Vitter. 2016. Fast construction of wavelet trees. Theor. Comput. Sci., Vol. 638 (2016), 91--97. https://doi.org/10.1016/j.tcs.2015.11.011
[11]
G. Navarro. 2014. Wavelet Trees for All. J. Discrete Algorithms, Vol. 25 (2014), 2--20. https://doi.org/10.1016/j.jda.2013.07.004
[12]
J. Shun. 2020. Improved parallel construction of wavelet trees and rank/select structures. Inf. Comput., Vol. 273 (2020), 104516. https://doi.org/10.1016/j.ic.2020.104516
[13]
Kaneta Y. 2018. Fast Wavelet Tree Construction in Practice. In SPIRE (Lecture Notes in Computer Science, Vol. 11147). Springer, 218--232. https://doi.org/10.1007/978--3-030-00479--8_18
Index Terms
- Bit-Parallel Wavelet Tree Construction (Abstract)
Recommendations
Parallel External Memory Wavelet Tree and Wavelet Matrix Construction
String Processing and Information RetrievalAbstractWe present the first parallel external memory wavelet tree and matrix construction algorithm. The algorithm’s throughput is nearly the same as the hard disk drives’ throughput, using six cores. We also present the fastest (parallel) semi-external ...
A DSP-enhanced 32-bit embedded microprocessor
Selected papers of EUC 2005EISC (Extendable Instruction Set Computer) is a compressed code architecture developed for embedded applications. In this paper, we propose a DSP-enhanced embedded microprocessor based on the 32-bit EISC architecture. We present how we could exploit the ...
VAST-Tree: a vector-advanced and compressed structure for massive data tree traversal
EDBT '12: Proceedings of the 15th International Conference on Extending Database TechnologyWe propose a compact and efficient index structure for massive data sets. Several indexing techniques are widely-used and well-known such as binary trees and B+trees. Unfortunately, we find that these techniques suffer major two shortcomings when ...
Comments
Information & Contributors
Information
Published In
Copyright © 2024 Owner/Author.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- SIGARCH: ACM Special Interest Group on Computer Architecture
- EATCS: European Association for Theoretical Computer Science
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 26 July 2024
Check for updates
Author Tags
Qualifiers
- Poster
Funding Sources
Conference
SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures
June 17, 2024
Nantes, France
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 16Total Downloads
- Downloads (Last 12 months)16
- Downloads (Last 6 weeks)13
Reflects downloads up to 21 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in