Permuting Web Graphs

13 years 10 months ago

Download www.eecs.harvard.edu

Since the ﬁrst investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental inﬂuence on the compression rate (usually expressed as the number of bits per link). The author of the LINK database [1], for instance, investigated three different approaches: an extrinsic ordering (URL ordering) and two intrinsic (or coordinatefree) orderings based on the rows of the adjacency matrix (lexicographic and Gray code); they concluded that URL ordering has many advantages in spite of a small penalty in compression. In this paper we approach this issue in a more systematic way, testing some old orderings and proposing some new ones. Our experiments are made in the WebGraph framework [2], and show that the compression technique and the structure of the graph can produce signiﬁcantly different results. In particular, we show that for the transpose web graph URL ordering is significantly less effective, and that some new orderings combin...

Paolo Boldi, Massimo Santini, Sebastiano Vigna

Real-time Traffic