The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Vários métodos foram propostos para compactar os dados de ligação de um gráfico da Web. Dentre eles, o método proposto por Boldi e Vigna é conhecido como o mais eficiente. No artigo, propomos um novo método para compactar um gráfico da Web. Nosso método é mais eficiente que o deles no que diz respeito ao tamanho dos dados compactados. Por exemplo, nosso método precisa de apenas 1.99 bits por link para compactar um gráfico da Web contendo 3,216,152 links conectando 325,557 páginas, enquanto o método de Boldi e Vigna precisa de 2.84 bits por link para compactar o mesmo gráfico da Web.
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.
Copiar
Yasuhito ASANO, Yuya MIYAWAKI, Takao NISHIZEKI, "Efficient Compression of Web Graphs" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 10, pp. 2454-2462, October 2009, doi: 10.1587/transfun.E92.A.2454.
Abstract: Several methods have been proposed for compressing the linkage data of a Web graph. Among them, the method proposed by Boldi and Vigna is known as the most efficient one. In the paper, we propose a new method to compress a Web graph. Our method is more efficient than theirs with respect to the size of the compressed data. For example, our method needs only 1.99 bits per link to compress a Web graph containing 3,216,152 links connecting 325,557 pages, while the method of Boldi and Vigna needs 2.84 bits per link to compress the same Web graph.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.2454/_p
Copiar
@ARTICLE{e92-a_10_2454,
author={Yasuhito ASANO, Yuya MIYAWAKI, Takao NISHIZEKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Compression of Web Graphs},
year={2009},
volume={E92-A},
number={10},
pages={2454-2462},
abstract={Several methods have been proposed for compressing the linkage data of a Web graph. Among them, the method proposed by Boldi and Vigna is known as the most efficient one. In the paper, we propose a new method to compress a Web graph. Our method is more efficient than theirs with respect to the size of the compressed data. For example, our method needs only 1.99 bits per link to compress a Web graph containing 3,216,152 links connecting 325,557 pages, while the method of Boldi and Vigna needs 2.84 bits per link to compress the same Web graph.},
keywords={},
doi={10.1587/transfun.E92.A.2454},
ISSN={1745-1337},
month={October},}
Copiar
TY - JOUR
TI - Efficient Compression of Web Graphs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2454
EP - 2462
AU - Yasuhito ASANO
AU - Yuya MIYAWAKI
AU - Takao NISHIZEKI
PY - 2009
DO - 10.1587/transfun.E92.A.2454
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2009
AB - Several methods have been proposed for compressing the linkage data of a Web graph. Among them, the method proposed by Boldi and Vigna is known as the most efficient one. In the paper, we propose a new method to compress a Web graph. Our method is more efficient than theirs with respect to the size of the compressed data. For example, our method needs only 1.99 bits per link to compress a Web graph containing 3,216,152 links connecting 325,557 pages, while the method of Boldi and Vigna needs 2.84 bits per link to compress the same Web graph.
ER -