Compact Encoding of the Web Graph Exploiting Various Power Distributions

Yasuhito ASANO, Tsuyoshi ITO, Hiroshi IMAI, Masashi TOYODA, Masaru KITSUREGAWA

  • Full Text Views

    0

  • Cite this

Summary :

Compact encodings of the web graph are required in order to keep the graph on the main memory and to perform operations on the graph efficiently. In this paper, we propose a new compact encoding of the web graph. It is 10% more compact than Link2 used in the Connectivity Server of Altavista and 20% more compact than the encoding proposed by Guillaume et al. in 2002 and is comparable to it in terms of extraction time.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.5 pp.1183-1184
Publication Date
2004/05/01
Publicized
Online ISSN
DOI
Type of Manuscript
Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category

Authors

Keyword

FlyerIEICE has prepared a flyer regarding multilingual services. Please use the one in your native language.