Pushing the Envelope in Graph Compression

@article{Liakos2014PushingTE,
  title={Pushing the Envelope in Graph Compression},
  author={Panagiotis Liakos and Katia Papakonstantinopoulou and Michael Sioutis},
  journal={Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management},
  year={2014}
}
We improve the state-of-the-art method for the compression of web and other similar graphs by introducing an elegant technique which further exploits the clustering properties observed in these graphs. The analysis and experimental evaluation of our method shows that it outperforms the currently best method of Boldi et al. by achieving a better compression ratio and retrieval time. Our method exhibits vast improvements on certain families of graphs, such as social networks, by taking advantage… 
View on ACM
cril.univ-artois.fr
26 Citations
Highly Influential Citations
3
Background Citations
19
Methods Citations
8
Results Citations
1

Figures and Tables from this paper

26 Citations

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

A survey and taxonomy on lossless graph compression that is the first, to the best of the knowledge, to exhaustively analyze this domain and can be used as a guide to select the best lossless compression scheme in a given setting.

Compressing bipartite graphs with a dual reordering scheme

This paper focuses on the class of bipartite graphs and adapt the vertex reordering phase to their specific structure by proposing a dual reordering scheme and shows that it can reach better compression rates.

An effective graph summarization and compression technique for a large-scaled graph

This work presents a greedy-based algorithm that greatly reduces the size of a large graph by applying both the compression and summarization strategies, and proposes a novel cost model for calculating the compression ratio considering both the compressor and summary strategies.

An effective graph summarization and compression technique for a large-scaled graph

This work presents a greedy-based algorithm that greatly reduces the size of a large graph by applying both the compression and summarization strategies, and proposes a novel cost model for calculating the compression ratio considering both the compressor and summary strategies.

Pool Compression for Undirected Graphs

We present a new graph compression scheme that intrinsically exploits the similarity and locality of references in a graph by first ordering the nodes and then merging the contiguous adjacency lists…

Faster compression methods for a weighted graph using locality sensitive hashing

A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs

A low–complexity lossless compression algorithm for sparse marked graphs, i.e. graphical data indexed by sparse graphs, which is capable of universally achieving the optimal compression rate in a precisely defined sense is introduced.

Queryable compression on streaming social networks

This work introduces their social network compressed data structure as an indexed array of compressed binary trees, which provides fast access methods for edge existence, neighbor queries, and streaming operations (add/remove nodes/edges).

Queryable Compression for Massively Streaming Social Networks

This work uses a novel data structure for streaming graphs that is based on an indexed array of compressed binary trees that builds the graph directly without using any temporary storage structures, and provides fast access methods for edge existence, neighbor queries, and streaming operations.

Queryable Compression on Time-Evolving Social Networks with Streaming

This work adapts its strategy to compress time-evolving graphs, rather than static ones, and achieves the smallest representation of 4.9GB on the largest dataset which only spans three days yet occupies 21.5GB of space.

References

SHOWING 1-10 OF 30 REFERENCES

Graph Compression by BFS

A compression scheme that combines efficient storage with fast retrieval for the information in a node and exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs.

Towards compressing Web graphs

The performance of the algorithms on graphs generated by the random graph models suggests that by taking advantage of the link structure of the Web, one may achieve significantly better compression than natural Huffman-based schemes.

Compressing the graph structure of the Web

This work describes techniques for compressing the graph structure of the Web, and gives experimental results of a prototype implementation and attempts to exploit a variety of different sources of compressibility of these graphs and of the associated set of URLs in order to obtain good compression performance on a large Web graph.

Efficient Compression of Web Graphs

This paper proposes a new method to compress a Web graph that is more efficient than Boldi and Vigna's method with respect to the size of the compressed data.

On the Effect of Locality in Compressing Social Networks

This work improves the state-of-the-art method for graph compression by exploiting the locality of reference observed in social network graphs by taking advantage of certain dense parts of those graphs, which enable the overall space requirements to be reduced.

A Fast and Compact Web Graph Representation

This paper shows that the same properties of Web graphs can be exploited with a different and elegant technique, built on Re-Pair compression, which achieves about the same space but much faster navigation of the graph.

Permuting Web and Social Graphs

It is shown that for a transposed web graph, URL ordering is significantly less effective, and that some new mixed orderings combining host information and Gray/lexicographic orderings outperform all previous methods.

On compressing social networks

This work proposes simple combinatorial formulations that encapsulate efficient compressibility of graphs and shows that some of the problems are NP-hard yet admit effective heuristics, some of which can exploit properties of social networks such as link reciprocity.

Practical representations for web and social graphs

A new proposal for indexing MPK linearizations, which have proven to be an effective way of representing social networks in little space by exploiting common dense subgraphs, is explored.

The webgraph framework I: compression techniques

This papers presents the compression techniques used in WebGraph, which are centred around referentiation and intervalisation (which in turn are dual to each other).