A Space Efficient Direct Access Data Structure

Gilad Baruch; Shmuel T. Klein; Dana Shapira

doi:10.1109/dcc.2016.61

A Space Efficient Direct Access Data Structure

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

In previous work we have suggested a data structure based on pruning a Huffman shaped Wavelet tree according to the underlying skeleton Huffman tree. This pruned Wavelet tree was especially designed to support faster random access and save memory storage, at the price of less effective rank and select operations, as compared to the original Huffman shaped Wavelet tree. In this paper we improve the pruning procedure and give empirical evidence that when memory storage is of main concern, our suggested data structure outperforms other direct access techniques such as those due to Külekci, DACs and sampling, with a slowdown as compared to DACs and fixed length encoding.

Original language	English
Title of host publication	Proceedings - DCC 2016
Subtitle of host publication	2016 Data Compression Conference
Editors	Michael W. Marcellin, Ali Bilgin, Joan Serra-Sagrista, James A. Storer
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	63-72
Number of pages	10
ISBN (Electronic)	9781509018536
DOIs	https://doi.org/10.1109/dcc.2016.61
State	Published - 15 Dec 2016
Event	2016 Data Compression Conference, DCC 2016 - Snowbird, United States Duration: 29 Mar 2016 → 1 Apr 2016

Publication series

Name	Data Compression Conference Proceedings
ISSN (Print)	1068-0314

Conference

Conference	2016 Data Compression Conference, DCC 2016
Country/Territory	United States
City	Snowbird
Period	29/03/16 → 1/04/16

Bibliographical note

Publisher Copyright:
© 2016 IEEE.

Keywords

Skeleton Huffman Trees
Succinct Data Structures
Wavelet Tree

Access to Document

10.1109/dcc.2016.61

Cite this

Baruch, G., Klein, S. T., & Shapira, D. (2016). A Space Efficient Direct Access Data Structure. In M. W. Marcellin, A. Bilgin, J. Serra-Sagrista, & J. A. Storer (Eds.), Proceedings - DCC 2016: 2016 Data Compression Conference (pp. 63-72). Article 7786150 (Data Compression Conference Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/dcc.2016.61

@inproceedings{74b7e83e60974cf68eee6e02da9f9d1c,

title = "A Space Efficient Direct Access Data Structure",

abstract = "In previous work we have suggested a data structure based on pruning a Huffman shaped Wavelet tree according to the underlying skeleton Huffman tree. This pruned Wavelet tree was especially designed to support faster random access and save memory storage, at the price of less effective rank and select operations, as compared to the original Huffman shaped Wavelet tree. In this paper we improve the pruning procedure and give empirical evidence that when memory storage is of main concern, our suggested data structure outperforms other direct access techniques such as those due to K{\"u}lekci, DACs and sampling, with a slowdown as compared to DACs and fixed length encoding.",

keywords = "Skeleton Huffman Trees, Succinct Data Structures, Wavelet Tree",

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

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 Data Compression Conference, DCC 2016 ; Conference date: 29-03-2016 Through 01-04-2016",

year = "2016",

month = dec,

day = "15",

doi = "10.1109/dcc.2016.61",

language = "אנגלית",

series = "Data Compression Conference Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "63--72",

editor = "Marcellin, {Michael W.} and Ali Bilgin and Joan Serra-Sagrista and Storer, {James A.}",

booktitle = "Proceedings - DCC 2016",

address = "ארצות הברית",

}

Baruch, G, Klein, ST & Shapira, D 2016, A Space Efficient Direct Access Data Structure. in MW Marcellin, A Bilgin, J Serra-Sagrista & JA Storer (eds), Proceedings - DCC 2016: 2016 Data Compression Conference., 7786150, Data Compression Conference Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 63-72, 2016 Data Compression Conference, DCC 2016, Snowbird, United States, 29/03/16. https://doi.org/10.1109/dcc.2016.61

A Space Efficient Direct Access Data Structure. / Baruch, Gilad; Klein, Shmuel T.; Shapira, Dana.
Proceedings - DCC 2016: 2016 Data Compression Conference. ed. / Michael W. Marcellin; Ali Bilgin; Joan Serra-Sagrista; James A. Storer. Institute of Electrical and Electronics Engineers Inc., 2016. p. 63-72 7786150 (Data Compression Conference Proceedings).

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

TY - GEN

T1 - A Space Efficient Direct Access Data Structure

AU - Baruch, Gilad

AU - Klein, Shmuel T.

AU - Shapira, Dana

PY - 2016/12/15

Y1 - 2016/12/15

N2 - In previous work we have suggested a data structure based on pruning a Huffman shaped Wavelet tree according to the underlying skeleton Huffman tree. This pruned Wavelet tree was especially designed to support faster random access and save memory storage, at the price of less effective rank and select operations, as compared to the original Huffman shaped Wavelet tree. In this paper we improve the pruning procedure and give empirical evidence that when memory storage is of main concern, our suggested data structure outperforms other direct access techniques such as those due to Külekci, DACs and sampling, with a slowdown as compared to DACs and fixed length encoding.

AB - In previous work we have suggested a data structure based on pruning a Huffman shaped Wavelet tree according to the underlying skeleton Huffman tree. This pruned Wavelet tree was especially designed to support faster random access and save memory storage, at the price of less effective rank and select operations, as compared to the original Huffman shaped Wavelet tree. In this paper we improve the pruning procedure and give empirical evidence that when memory storage is of main concern, our suggested data structure outperforms other direct access techniques such as those due to Külekci, DACs and sampling, with a slowdown as compared to DACs and fixed length encoding.

KW - Skeleton Huffman Trees

KW - Succinct Data Structures

KW - Wavelet Tree

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

U2 - 10.1109/dcc.2016.61

DO - 10.1109/dcc.2016.61

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

AN - SCOPUS:85010063150

T3 - Data Compression Conference Proceedings

SP - 63

EP - 72

BT - Proceedings - DCC 2016

A2 - Marcellin, Michael W.

A2 - Bilgin, Ali

A2 - Serra-Sagrista, Joan

A2 - Storer, James A.

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 Data Compression Conference, DCC 2016

Y2 - 29 March 2016 through 1 April 2016

ER -

A Space Efficient Direct Access Data Structure

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this