Efficient Wavelet Tree Construction and Querying for Multicore Architectures

  • José Fuentes-Sepúlveda
  • Erick Elejalde
  • Leo Ferres
  • Diego Seco
Conference paper

DOI: 10.1007/978-3-319-07959-2_13

Volume 8504 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Fuentes-Sepúlveda J., Elejalde E., Ferres L., Seco D. (2014) Efficient Wavelet Tree Construction and Querying for Multicore Architectures. In: Gudmundsson J., Katajainen J. (eds) Experimental Algorithms. SEA 2014. Lecture Notes in Computer Science, vol 8504. Springer, Cham

Abstract

Wavelet trees have become very useful to handle large data sequences efficiently. By the same token, in the last decade, multicore architectures have become ubiquitous, and parallelism in general has become extremely important in order to gain performance. This paper introduces two practical multicore algorithms for wavelet tree construction that run in O(n) time using \(\lg \sigma\) processors, where n is the size of the input and σ the alphabet size. Both algorithms have efficient memory consumption. We also present a querying technique based on batch processing that improves on simple domain-decomposition techniques.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • José Fuentes-Sepúlveda
    • 1
  • Erick Elejalde
    • 1
  • Leo Ferres
    • 1
  • Diego Seco
    • 1
  1. 1.Universidad de ConcepciónConcepciónChile