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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yasuhito ASANO, Tsuyoshi ITO, Hiroshi IMAI, Masashi TOYODA, Masaru KITSUREGAWA, "Compact Encoding of the Web Graph Exploiting Various Power Distributions" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 5, pp. 1183-1184, May 2004, doi: .
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e87-a_5_1183/_p
Copy
@ARTICLE{e87-a_5_1183,
author={Yasuhito ASANO, Tsuyoshi ITO, Hiroshi IMAI, Masashi TOYODA, Masaru KITSUREGAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Compact Encoding of the Web Graph Exploiting Various Power Distributions},
year={2004},
volume={E87-A},
number={5},
pages={1183-1184},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Compact Encoding of the Web Graph Exploiting Various Power Distributions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1183
EP - 1184
AU - Yasuhito ASANO
AU - Tsuyoshi ITO
AU - Hiroshi IMAI
AU - Masashi TOYODA
AU - Masaru KITSUREGAWA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2004
AB - 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.
ER -