Compressing Graphs and Indexes with Recursive Graph Bisection

Abstract

Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be used to improve compression of graphs and inverted indexes. We extend the recent theoretical model of Chierichetti et al. (KDD 2009) for graph compression, and show how it can be employed for compression-friendly reordering of social networks and web graphs and for assigning document identifiers in inverted indexes. We design and implement a novel theoretically sound reordering algorithm that is based on recursive graph bisection. Our experiments show a significant improvement of the compression rate of graph and indexes over existing heuristics. The new method is relatively simple and allows efficient parallel and distributed implementations, which is demonstrated on graphs with billions of vertices and hundreds of billions of edges.

References in corpus (2)

• Near linear time algorithm to detect community structures in large-scale networks
• A Survey on Methods and Systems for Graph Compression

Cited by in corpus (15)

• Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
• Graph Summarization Methods and Applications: A Survey
• Techniques for Inverted Index Compression
• Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations
• Incremental Lossless Graph Summarization
• Wacky Weights in Learned Sparse Representations and the Revenge of Score-at-a-Time Query Evaluation
• Graph Summarization via Node Grouping: A Spectral Algorithm
• On the current failure -- but bright future -- of topology-driven biological network alignment
• Efficient Immediate-Access Dynamic Indexing
• Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm
• Partition and Code: learning how to compress graphs
• Direction Matters: On Influence-Preserving Graph Summarization and Max-cut Principle for Directed Graphs
• Efficient Butterfly Counting for Large Bipartite Networks
• Time-Efficient and High-Quality Graph Partitioning for Graph Dynamic Scaling
• New Hardness Results for Planar Graph Problems in P and an Algorithm for Sparsest Cut