ITR: Grammar-based Graph Compression Supporting Fast Triple Queries

Neighborhood queries and triple queries are the most common queries on graphs; thus, it is desirable to answer them efficiently on compressed data structures. We present a compression scheme called Incidence-Type-RePair (ITR) for graphs with labeled nodes and labeled edges based on RePair and apply...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Adler, Enno, Böttcher, Stefan, Hartel, Rita
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 10.10.2024
Subjects
Compressors
Data structures
Graphs
Queries
Online AccessGet full text

Cover

More Information
Summary:Neighborhood queries and triple queries are the most common queries on graphs; thus, it is desirable to answer them efficiently on compressed data structures. We present a compression scheme called Incidence-Type-RePair (ITR) for graphs with labeled nodes and labeled edges based on RePair and apply the scheme to network, version, and RDF graphs. We show that ITR performs neighborhood queries and triple queries within only a few milliseconds and thereby outperforms existing RePair-based solutions on graphs while providing a compression size comparable to existing graph compressors.
ISSN:2331-8422