Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics

by   Maciej Besta, et al.

We propose Slim Graph: the first programming model and framework for practical lossy graph compression that facilitates high-performance approximate graph processing, storage, and analytics. Slim Graph enables the developer to express numerous compression schemes using small and programmable compression kernels that can access and modify local parts of input graphs. Such kernels are executed in parallel by the underlying engine, isolating developers from complexities of parallel programming. Our kernels implement novel graph compression schemes that preserve numerous graph properties, for example connected components, minimum spanning trees, or graph spectra. Finally, Slim Graph uses statistical divergences and other metrics to analyze the accuracy of lossy graph compression. We illustrate both theoretically and empirically that Slim Graph accelerates numerous graph algorithms, reduces storage used by graph datasets, and ensures high accuracy of results. Slim Graph may become the common ground for developing, executing, and analyzing emerging lossy graph compression schemes.



page 1

page 2

page 4

page 10


Compression with wildcards: All spanning trees

By processing all minimal cutsets of a graph G, and by using novel wildc...

Log(Graph): A Near-Optimal High-Performance Graph Representation

Today's graphs used in domains such as machine learning or social networ...

From NoSQL Accumulo to NewSQL Graphulo: Design and Utility of Graph Algorithms inside a BigTable Database

Google BigTable's scale-out design for distributed key-value storage ins...

Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations

Various graphs such as web or social networks may contain up to trillion...

Graph Wedgelets: Adaptive Data Compression on Graphs based on Binary Wedge Partitioning Trees and Geometric Wavelets

We introduce graph wedgelets - a tool for data compression on graphs bas...

Benchmarking the Graphulo Processing Framework

Graph algorithms have wide applicablity to a variety of domains and are ...

GraphGuess: Approximate Graph Processing System with Adaptive Correction

Graph-based data structures have drawn great attention in recent years. ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.