Grammar-Based Compression of Unranked Trees

被引：1

作者：

Gascon, Adria ^{[1
,2
]}

Lohrey, Markus ^{[3
]}

Maneth, Sebastian ^{[4
]}

Reh, Carl Philipp ^{[3
]}

Sieber, Kurt ^{[3
]}

机构：

[1] Univ Warwick, Coventry, W Midlands, England

[2] Alan Turing Inst, London, England

[3] Univ Siegen, Siegen, Germany

[4] Univ Bremen, Bremen, Germany

来源：

THEORY OF COMPUTING SYSTEMS | 2020年 / 64卷 / 01期

基金：

英国工程与自然科学研究理事会;

关键词：

Grammar-based tree compression; Top dags; Equality testing; Forest; UNORDERED XML;

D O I：

10.1007/s00224-019-09942-y

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We introduce forest straight-line programs (FSLPs for short) as a compressed representation of unranked ordered node-labelled trees. FSLPs are based on the operations of forest algebra and generalize tree straight-line programs. We compare the succinctness of FSLPs with two other compression schemes for unranked trees: top dags and tree straight-line programs of first-child/next sibling encodings. Efficient translations between these formalisms are provided. Finally, we show that equality of unranked trees in the setting where certain symbols are associative and/or commutative can be tested in polynomial time. This generalizes previous results for testing isomorphism of compressed unordered ranked trees. An extended abstract of this paper appeared in Gascoon et al. (2018).

引用

页码：141 / 176

页数：36

共 50 条

[1] Grammar-Based Compression of Unranked Trees
Adrià Gascón
Markus Lohrey
Sebastian Maneth
Carl Philipp Reh
Kurt Sieber
[J]. Theory of Computing Systems, 2020, 64 : 141 - 176
[2] Grammar-Based Compression of Unranked Trees
Gascon, Adria
Lohrey, Markus
Maneth, Sebastian
Reh, Carl Philipp
Siebert, Kurt
[J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, CSR 2018, 2018, 10846 : 118 - 131
[3] A bisection algorithm for grammar-based compression of ordered trees
Akutsu, Tatsuya
[J]. INFORMATION PROCESSING LETTERS, 2010, 110 (18-19) : 815 - 820
[4] A Universal Grammar-Based Code for Lossless Compression of Binary Trees
Zhang, Jie L.
Yang, En-Hui
Kieffer, John C.
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (03) : 1373 - 1386
[5] Grammar-Based Tree Compression
Lohrey, Markus
[J]. DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 46 - 57
[6] Grammar-based graph compression
Maneth, Sebastian
Peternek, Fabian
[J]. INFORMATION SYSTEMS, 2018, 76 : 19 - 45
[7] Grammar-based compression of interpreted code
Evans, WS
Fraser, CW
[J]. COMMUNICATIONS OF THE ACM, 2003, 46 (08) : 61 - 66
[8] On the complexity of optimal grammar-based compression
Arpe, Jan
Reischuk, R. diger
[J]. DCC 2006: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2006, : 173 - +
[9] Grammar-Based Compression in a Streaming Model
Gagie, Travis
Gawrychowski, Pawel
[J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2010, 6031 : 273 - +
[10] Approximation algorithms for grammar-based compression
Lehman, E
Shelat, A
[J]. PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 205 - 212

← 1 2 3 4 5 →