Tree compression with top trees

Philip Bille; Inge Li Gørtz; Gad M. Landau; Oren Weimann

doi:10.1016/j.ic.2014.12.012

Tree compression with top trees

Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann

Department of Computer Science

University of Haifa

Research output: Contribution to journal › Article › peer-review

Abstract

We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time.

Original language	American English
Pages (from-to)	166-177
Number of pages	12
Journal	Information and Computation
Volume	243
DOIs	https://doi.org/10.1016/j.ic.2014.12.012
State	Published - 1 Aug 2015

Keywords

Pattern matching
Top trees
Tree compression

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Computer Science Applications
Computational Theory and Mathematics

Access to Document

10.1016/j.ic.2014.12.012

Cite this

@article{c14c5526a6ad43b0a6d450f0f808dbcd,

title = "Tree compression with top trees",

abstract = "We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time.",

keywords = "Pattern matching, Top trees, Tree compression",

author = "Philip Bille and G{\o}rtz, \{Inge Li\} and Landau, \{Gad M.\} and Oren Weimann",

note = "Publisher Copyright: {\textcopyright} 2015 Elsevier Inc.",

year = "2015",

month = aug,

day = "1",

doi = "10.1016/j.ic.2014.12.012",

language = "American English",

volume = "243",

pages = "166--177",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Tree compression with top trees

AU - Bille, Philip

AU - Gørtz, Inge Li

AU - Landau, Gad M.

AU - Weimann, Oren

PY - 2015/8/1

Y1 - 2015/8/1

N2 - We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time.

AB - We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time.

KW - Pattern matching

KW - Top trees

KW - Tree compression

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

U2 - 10.1016/j.ic.2014.12.012

DO - 10.1016/j.ic.2014.12.012

M3 - Article

SN - 0890-5401

VL - 243

SP - 166

EP - 177

JO - Information and Computation

JF - Information and Computation

ER -

Tree compression with top trees

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this