Wavelet trees: a survey

Christos Makris1

  1. Department of Computer Engineering and Informatics, University of Patras
    26500 Patras, Greece
    makri@ceid.upatras.gr

Abstract

The topic of this paper is the exploration of the various characteristics of the wavelet tree data structure, a data structure that was initially proposed for text compression applications but has found a plethora of other uses in text indexing and retrieval. Issues concerning the efficient maintenance of the structure, plus its handling in various applications are explored. Our main aim is to provide to computer science researchers that would like to explore the specific area, an up-to-date comprehensive material covering a wide range of applications. This kind of up-to-date survey is missing from the current bibliography and we hope that it will help young researchers to get familiar with the notions of this research area.

Key words

information retrieval, text algorithms, data structures

Digital Object Identifier (DOI)

https://doi.org/10.2298/CSIS110606004M

Publication information

Volume 9, Issue 2 (June 2012)
Year of Publication: 2012
ISSN: 1820-0214 (Print) 2406-1018 (Online)
Publisher: ComSIS Consortium

Full text

DownloadAvailable in PDF
Portable Document Format

How to cite

Makris, C.: Wavelet trees: a survey. Computer Science and Information Systems, Vol. 9, No. 2, 585-625. (2012)