# Grammar-Based Graph Compression

## TL;DR

This paper introduces a grammar-based graph compression method that recursively detects repeated substructures, resulting in smaller representations and enabling efficient query evaluation on compressed graphs.

## Contribution

The paper proposes a novel grammar-based approach for graph compression that improves size reduction and query efficiency compared to existing methods.

## Key findings

- Achieves smaller graph representations for many graph types.
- Enables linear-time reachability queries on compressed graphs.
- Allows regular path queries with quadratic time complexity.

## Abstract

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.