Authors
Paolo Boldi, Sebastiano Vigna
Publication date
2004/5/17
Book
Proceedings of the 13th international conference on World Wide Web
Pages
595-602
Description
Studying web graphs is often difficult due to their large size. Recently,several proposals have been published about various techniques that allow tostore a web graph in memory in a limited space, exploiting the inner redundancies of the web. The WebGraph framework is a suite of codes, algorithms and tools that aims at making it easy to manipulate large web graphs. This papers presents the compression techniques used in WebGraph, which are centred around referentiation and intervalisation (which in turn are dual to each other). WebGraph can compress the WebBase graph (118 Mnodes, 1 Glinks)in as little as 3.08 bits per link, and its transposed version in as littleas 2.89 bits per link.
Total citations
Scholar articles
P Boldi, S Vigna - Proceedings of the 13th international conference on …, 2004