Accelerated partial decoding in wavelet trees

Gilad Baruch, Shmuel T. Klein, Dana Shapira

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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. As random access is one of these operations, the underlying file is not needed anymore, and is often discarded because it can be restored, when necessary, by repeated accesses. This paper concentrates on cases in which partial decoding of a contiguous portion of the file, or even its full decoding, is still needed. We show how to accelerate the decoding relative to repeatedly performing random accesses on the consecutive indices. Preliminary experiments on full decoding support the effectiveness of our approach, and present an improvement of about 60% of the run-time.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference, PSC 2016
EditorsJan Holub, Jan Zdarek
PublisherPrague Stringology Club
Pages63-70
Number of pages8
ISBN (Electronic)9788001059968
StatePublished - 2016
Event20th Prague Stringology Conference, PSC 2016 - Prague, Czech Republic
Duration: 29 Aug 201631 Aug 2016

Publication series

NameProceedings of the Prague Stringology Conference, PSC 2016

Conference

Conference20th Prague Stringology Conference, PSC 2016
Country/TerritoryCzech Republic
CityPrague
Period29/08/1631/08/16

Bibliographical note

Publisher Copyright:
© Czech Technical University in Prague.

Fingerprint

Dive into the research topics of 'Accelerated partial decoding in wavelet trees'. Together they form a unique fingerprint.

Cite this