Efficient and Simple Encodings for the Web Graph - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

Efficient and Simple Encodings for the Web Graph

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.
Fichier principal
Vignette du fichier
waim2002.pdf (297.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00471704 , version 1 (08-04-2010)

Identifiers

Cite

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⟩
483 View
116 Download

Altmetric

Share

Gmail Facebook X LinkedIn More