Sciweavers

174 search results - page 2 / 35
» Efficient Compression of Web Graphs
Sort
View
WWW
2007
ACM
14 years 6 months ago
Towards efficient dominant relationship exploration of the product items on the web
In recent years, there has been a prevalence of search engines being employed to find useful information in the Web as they efficiently explore hyperlinks between web pages which ...
Zhenglu Yang, Lin Li, Botao Wang, Masaru Kitsurega...
WAW
2009
Springer
136views Algorithms» more  WAW 2009»
13 years 12 months ago
Permuting Web Graphs
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
SIGIR
2008
ACM
13 years 5 months ago
A large time-aware web graph
We describe the techniques developed to gather and distribute in a highly compressed, yet accessible, form a series of twelve snapshot of the .uk web domain. Ad hoc compression
Paolo Boldi, Massimo Santini, Sebastiano Vigna
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 5 days ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
SPIRE
2007
Springer
13 years 11 months ago
A Fast and Compact Web Graph Representation
Compressed graphs representation has become an attractive research topic because of its applications to the manipulation of huge Web graphs in main memory. By far the best current ...
Francisco Claude, Gonzalo Navarro