We present parallel lightweight algorithms to construct wavelet trees, rank and select
structures, and suffix arrays in a shared-memory setting. The work and depth of our first …

The process of searching on the World Wide Web (WWW) is increasing regularly, and users
around the world also use it regularly. In WWW the size of the text corpus is constantly …

Fast retrieval through indexing from spatial databases has been considered a more
challenging task for enhancing network performance in the last few decades. The wavelet …

Parallelism is the key to achieving high performance in computing. However, writing efficient
and scalable parallel programs is notoriously difficult, and often requires significant …

The wavelet tree has become a very useful data structure to efficiently represent and query
large volumes of data in many different domains, from bioinformatics to geographic …

Existing parallel algorithms for wavelet tree construction have a work complexity of O (n log⁡
σ). This paper presents parallel algorithms for the problem with improved work complexity …

Text matching is a process of finding the frequency of occurrences of text pattern in a corpus.
It's very costly to store, process, and retrieve a vast volume of text data. In this paper, we …

We present parallel algorithms for wavelet tree construction with polylogarithmic depth,
improving upon the linear depth of the recent parallel algorithms by Fuentes-Sepulveda et …

The wavelet tree (Grossi et al.[SODA, 2003]) and wavelet matrix (Claude et al.[Inf. Syst., 47:
15–32, 2015]) are compact indices for texts over an alphabet [0, σ) that support rank, select …

Indexing is one of the key components of any search tool to be optimized for searching
documents. Among the existing indexing techniques, inverted indexing is one of the best …