Grammar-based graph compression

被引：21
|
作者：
Maneth, Sebastian [1 ]
Peternek, Fabian [2 ]
机构：
[1] Univ Bremen, Fachbereich Math Informat, Bremen, Germany
[2] Univ Edinburgh, Sch Informat, Edinburgh, Midlothian, Scotland
来源：
INFORMATION SYSTEMS | 2018年 / 76卷
关键词：
Graph compression; Straight-line context-free hyperedge replacement grammar; SUCCINCT REPRESENTATIONS; WEB GRAPHS; TREES; ALGORITHM; AUTOMATA;
D O I：
10.1016/j.is.2018.03.002
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present a new graph compressor that works by recursively detecting repeated substructures and representing them through grammar rules. We show that for a large number of graphs the compressor obtains smaller representations than other approaches. Specific queries such as reachability between two nodes or regular path queries can be evaluated in linear time (or quadratic times, respectively), over the grammar, thus allowing speed-ups proportional to the compression ratio. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码：19 / 45
页数：27
相关论文
共 50 条
  • [1] Grammar-Based Tree Compression
    Lohrey, Markus
    [J]. DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 46 - 57
  • [2] A graph grammar-based approach for graph layout
    Liu, Yufeng
    Zeng, Xiaoqin
    Zou, Yang
    Zhang, Kang
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 2018, 48 (09): : 1523 - 1535
  • [3] 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
  • [4] Grammar-Based Compression of Unranked Trees
    Gascon, Adria
    Lohrey, Markus
    Maneth, Sebastian
    Reh, Carl Philipp
    Sieber, Kurt
    [J]. THEORY OF COMPUTING SYSTEMS, 2020, 64 (01) : 141 - 176
  • [5] Grammar-based compression of interpreted code
    Evans, WS
    Fraser, CW
    [J]. COMMUNICATIONS OF THE ACM, 2003, 46 (08) : 61 - 66
  • [6] 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
  • [7] On the complexity of optimal grammar-based compression
    Arpe, Jan
    Reischuk, R. diger
    [J]. DCC 2006: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2006, : 173 - +
  • [8] ITR: Grammar-based graph compression supporting fast triple queries.
    Adler, Enno
    Boettcher, Stefan
    Hartel, Rita
    [J]. 2024 DATA COMPRESSION CONFERENCE, DCC, 2024, : 545 - 545
  • [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
12345