Compressing Graphs and Indexes with Recursive Graph Bisection
- 13 August 2016
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1535-1544
- https://doi.org/10.1145/2939672.2939862
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.Keywords
This publication has 29 references indexed in Scilit:
- Multiscale approach for the network compression-friendly orderingJournal of Discrete Algorithms, 2011
- Graph Compression by BFSAlgorithms, 2009
- Expander flows, geometric embeddings and graph partitioningJournal of the ACM, 2009
- ℓ 2 2 Spreading Metrics for Vertex Ordering ProblemsAlgorithmica, 2008
- Near linear time algorithm to detect community structures in large-scale networksPhysical Review E, 2007
- Inverted file compression through document identifier reassignmentInformation Processing & Management, 2003
- Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement ProblemsJournal of Graph Algorithms and Applications, 2001
- Divide-and-conquer approximation algorithms via spreading metricsJournal of the ACM, 2000
- How Good is Recursive Bisection?SIAM Journal on Scientific Computing, 1997
- Optimal linear labelings and eigenvalues of graphsDiscrete Applied Mathematics, 1992