Efficient Compression of Web Graphs


IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E92-A   No.10   pp.2454-2462
Publication Date: 2009/10/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E92.A.2454
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Data Compression
Web graph,  compression,  intra-host links,  localities,  

Full Text: PDF(228.4KB)
>>Buy this Article

Several methods have been proposed for compressing the linkage data of a Web graph. Among them, the method proposed by Boldi and Vigna is known as the most efficient one. In the paper, we propose a new method to compress a Web graph. Our method is more efficient than theirs with respect to the size of the compressed data. For example, our method needs only 1.99 bits per link to compress a Web graph containing 3,216,152 links connecting 325,557 pages, while the method of Boldi and Vigna needs 2.84 bits per link to compress the same Web graph.