Pushing the Envelope in Graph Compression

  title={Pushing the Envelope in Graph Compression},
  author={Panagiotis Liakos and Katia Papakonstantinopoulou and Michael Sioutis},
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… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications citing this paper.
Showing 1-10 of 10 extracted citations

Realizing Memory-Optimized Distributed Graph Processing

IEEE Transactions on Knowledge and Data Engineering • 2018
View 2 Excerpts

Queryable compression on streaming social networks

2017 IEEE International Conference on Big Data (Big Data) • 2017
View 2 Excerpts

Set-based approach for lossless graph summarization using Locality Sensitive Hashing

2015 31st IEEE International Conference on Data Engineering Workshops • 2015
View 1 Excerpt


Publications referenced by this paper.
Showing 1-9 of 9 references

Similar Papers

Loading similar papers…