Accelerated partial decoding in wavelet trees

Gilad Baruch; Shmuel T. Klein; Dana Shapira

Accelerated partial decoding in wavelet trees

Gilad Baruch, Shmuel T. Klein, Dana Shapira

Department of Computer Science

Ariel University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings of the Prague Stringology Conference, PSC 2016
Editors	Jan Holub, Jan Zdarek
Publisher	Prague Stringology Club
Pages	63-70
Number of pages	8
ISBN (Electronic)	9788001059968
State	Published - 2016
Event	20th Prague Stringology Conference, PSC 2016 - Prague, Czech Republic Duration: 29 Aug 2016 → 31 Aug 2016

Publication series

Name	Proceedings of the Prague Stringology Conference, PSC 2016

Conference

Conference	20th Prague Stringology Conference, PSC 2016
Country/Territory	Czech Republic
City	Prague
Period	29/08/16 → 31/08/16

Bibliographical note

Publisher Copyright:
© Czech Technical University in Prague.

Cite this

@inproceedings{b633d3dc8ec74e05a7ef944df52845d3,

title = "Accelerated partial decoding in wavelet trees",

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.",

author = "Gilad Baruch and Klein, {Shmuel T.} and Dana Shapira",

note = "Publisher Copyright: {\textcopyright} Czech Technical University in Prague.; 20th Prague Stringology Conference, PSC 2016 ; Conference date: 29-08-2016 Through 31-08-2016",

year = "2016",

language = "אנגלית",

series = "Proceedings of the Prague Stringology Conference, PSC 2016",

publisher = "Prague Stringology Club",

pages = "63--70",

editor = "Jan Holub and Jan Zdarek",

booktitle = "Proceedings of the Prague Stringology Conference, PSC 2016",

}

Accelerated partial decoding in wavelet trees. / Baruch, Gilad; Klein, Shmuel T.; Shapira, Dana.
Proceedings of the Prague Stringology Conference, PSC 2016. ed. / Jan Holub; Jan Zdarek. Prague Stringology Club, 2016. p. 63-70 (Proceedings of the Prague Stringology Conference, PSC 2016).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Accelerated partial decoding in wavelet trees

AU - Baruch, Gilad

AU - Klein, Shmuel T.

AU - Shapira, Dana

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85086025917&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85086025917

T3 - Proceedings of the Prague Stringology Conference, PSC 2016

SP - 63

EP - 70

BT - Proceedings of the Prague Stringology Conference, PSC 2016

A2 - Holub, Jan

A2 - Zdarek, Jan

PB - Prague Stringology Club

T2 - 20th Prague Stringology Conference, PSC 2016

Y2 - 29 August 2016 through 31 August 2016

ER -

Accelerated partial decoding in wavelet trees

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this