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… Expand

Figures, Tables, and Topics from this paper

Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations
TLDR
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. Expand
An effective graph summarization and compression technique for a large-scaled graph
TLDR
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. Expand
Faster compression methods for a weighted graph using locality sensitive hashing
TLDR
This work presents a set-based summarization approach that aggregates sets of nodes and proposes a non-parametric hashing scheme for LSH to generate candidate similar nodes from the weighted neighborhood of each node. Expand
A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs
TLDR
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. Expand
Set-based approach for lossless graph summarization using Locality Sensitive Hashing
  • Kifayat-Ullah Khan
  • Computer Science
  • 2015 31st IEEE International Conference on Data Engineering Workshops
  • 2015
TLDR
This paper proposes a set-based summarization method that aggregates the sets of similar nodes in each iteration, thus provides scalability and presents the scalable solutions for lossless summarization of both attributed and non-attributed graphs. Expand
Queryable compression on streaming social networks
TLDR
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). Expand
Queryable Compression for Massively Streaming Social Networks
TLDR
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. Expand
Queryable Compression on Time-Evolving Social Networks with Streaming
TLDR
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. Expand
Selfish Behavior and Compact Representation in Routing and Information Networks
In this short note we summarize our results on the study of selfish user behavior in modern networks and the compact representation of such networks in systems’ level. In the first part of theExpand
Memory-Optimized Distributed Graph Processing through Novel Compression Techniques
TLDR
This paper proposes three space-efficient adjacency list representations that can be applied to any distributed graph processing system and proposes memory-optimized methods that retain the efficiency of uncompressed structures and enable the execution of algorithms for large scale graphs in settings where contemporary alternative structures fail due to memory errors. Expand
...
1
2
...

References

SHOWING 1-10 OF 30 REFERENCES
Graph Compression by BFS
TLDR
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. Expand
Towards compressing Web graphs
TLDR
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. Expand
Compressing the graph structure of the Web
  • T. Suel, Jun Yuan
  • Computer Science
  • Proceedings DCC 2001. Data Compression Conference
  • 2001
TLDR
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. Expand
Efficient Compression of Web Graphs
TLDR
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. Expand
On the Effect of Locality in Compressing Social Networks
TLDR
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. Expand
A Fast and Compact Web Graph Representation
TLDR
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. Expand
Permuting Web and Social Graphs
TLDR
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. Expand
On compressing social networks
TLDR
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. Expand
Practical representations for web and social graphs
TLDR
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. Expand
The webgraph framework I: compression techniques
TLDR
This papers presents the compression techniques used in WebGraph, which are centred around referentiation and intervalisation (which in turn are dual to each other). Expand
...
1
2
3
...