Skip to Main content Skip to Navigation
New interface
Conference papers

Efficient and Simple Encodings for the Web Graph

Jean-Loup Guillaume 1 Matthieu Latapy 1, 2 Laurent Viennot 2 
2 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : In this paper, we propose a set of simple and efficient methods based on standard, free and widely available tools, to store and manipulate large sets of URLs and large parts of the Web graph. Our aim is both to store efficiently the URLs list and the graph in order to manage all the computations in a computer central memory. We also want to make the conversion between URLs and their identifiers as fast as possible, and to obtain all the successors of an URL in the Web graph efficiently. The methods we propose make it possible to obtain a good compromise between these two challenges, and make it possible to manipulate large parts of the Web graph.
Complete list of metadata
Contributor : Laurent Viennot Connect in order to contact the contributor
Submitted on : Thursday, April 8, 2010 - 5:50:30 PM
Last modification on : Wednesday, October 26, 2022 - 4:00:44 AM
Long-term archiving on: : Tuesday, September 14, 2010 - 6:07:23 PM


Files produced by the author(s)



Jean-Loup Guillaume, Matthieu Latapy, Laurent Viennot. Efficient and Simple Encodings for the Web Graph. The Third International Conference on Web-Age Information Management (WAIM), Aug 2002, Beijing, China. ⟨10.1007/3-540-45703-8_30⟩. ⟨inria-00471704⟩



Record views


Files downloads