2004 TheWebGraphFrameworkI

• (Boldi & Vigna, 2004) ⇒ Paolo Boldi, Sebastiano Vigna. (2004). “The Webgraph Framework I: compression techniques.” In: Proceedings of the 13th International Conference on World Wide Web (WWW 2004). doi:10.1145/988672.988752

Subject Headings: Web Graph, Graph Compression Task.

Quotes

Abstract

• 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.

---

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2004 TheWebGraphFrameworkI	Paolo Boldi Sebastiano Vigna			The Webgraph Framework I: compression techniques			http://wwwconference.org/www2004/docs/1p595.pdf	10.1145/988672.988752