Exploiting Computation-Friendly Graph Compression Methods

Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In this paper we show that some well-known Web and social graph compression formats are computation-friendly, in the sense that they allow boosting the computation. In particular, we show that the format of Boldi and Vigna allows computing the product in time proportional to the compressed graph size. Our experimental results show speedups of at least 2 on graphs that were compressed at least 5 times with respect to the original. We show that other successful graph compression formats enjoy this property as well.

[1]  Fan Chung,et al.  The heat kernel as the pagerank of a graph , 2007, Proceedings of the National Academy of Sciences.

[2]  Gonzalo Navarro,et al.  Compressed representations for web and social graphs , 2013, Knowledge and Information Systems.

[3]  Simon J. Puglisi,et al.  Approximate pattern matching in LZ77-compressed texts , 2015, J. Discrete Algorithms.

[4]  Markus Lohrey,et al.  Constructing small tree grammars and small circuits for formulas , 2014, J. Comput. Syst. Sci..

[5]  Monika Henzinger,et al.  Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture , 2015, STOC.

[6]  Michal Ziv-Ukelson,et al.  Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions , 2007, Algorithmica.

[7]  Markus Lohrey,et al.  Algorithmics on SLP-compressed strings: A survey , 2012, Groups Complex. Cryptol..

[8]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[9]  Sebastiano Vigna,et al.  The webgraph framework I: compression techniques , 2004, WWW '04.

[10]  Silvio Lattanzi,et al.  On compressing social networks , 2009, KDD.

[11]  F. Chung,et al.  Complex Graphs and Networks , 2006 .

[12]  Gonzalo Navarro,et al.  Compact representation of Web graphs with extended functionality , 2014, Inf. Syst..

[13]  Marco Rosa,et al.  Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks , 2010, WWW.

[14]  Sebastiano Vigna,et al.  BUbiNG: massive crawling for the masses , 2014, WWW.

[15]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[16]  Sebastiano Vigna,et al.  Codes for the World Wide Web , 2005, Internet Math..

[17]  Josh Alman,et al.  Further Limitations of the Known Approaches for Matrix Multiplication , 2017, ITCS.

[18]  Gonzalo Navarro,et al.  Fast and Compact Web Graph Representations , 2010, TWEB.

[19]  Kasper Green Larsen,et al.  Faster Online Matrix-Vector Multiplication , 2016, SODA.

[20]  Masaaki Nagata,et al.  Accelerating Graph Adjacency Matrix Multiplications with Adjacency Forest , 2014, SDM.

[21]  Szymon Grabowski,et al.  Merging Adjacency Lists for Efficient Web Graph Compression , 2011, ICMMI.

[22]  Gad M. Landau,et al.  Unified Compression-Based Acceleration of Edit-Distance Computation , 2011, Algorithmica.

[23]  Kumar Chellapilla,et al.  Speeding up algorithms on compressed web graphs , 2009, WSDM '09.