Sciweavers

174 search results - page 4 / 35
» Efficient Compression of Web Graphs
Sort
View
ICDE
2003
IEEE
129views Database» more  ICDE 2003»
14 years 11 months ago
Representing Web Graphs
A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navig...
Sriram Raghavan, Hector Garcia-Molina
DASFAA
2010
IEEE
169views Database» more  DASFAA 2010»
13 years 7 months ago
Fires on the Web: Towards Efficient Exploring Historical Web Graphs
Abstract. Discovery of evolving regions in large graphs is an important issue because it is the basis of many applications such as spam websites detection in the Web, community lif...
Zhenglu Yang, Jeffrey Xu Yu, Zheng Liu, Masaru Kit...
HT
2009
ACM
14 years 4 months ago
The scalable hyperlink store
This paper describes the Scalable Hyperlink Store, a distributed in-memory “database” for storing large portions of the web graph. SHS is an enabler for research on structural...
Marc Najork
BIRTHDAY
2010
Springer
14 years 4 months ago
Extended Compact Web Graph Representations
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...
Francisco Claude, Gonzalo Navarro
ICCTA
2007
IEEE
14 years 1 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor