webbase_2001 — WebBase web graph (2001)
- Description
A web graph obtained from the 2001 crawl performed by the Stanford WebBase crawler, as distributed by the Laboratory for Web Algorithmics (LAW). Nodes are web pages (URLs), and a directed edge from one page to another indicates a hyperlink between them. The data provided by WebBase were filtered by LAW to eliminate invalid links and to normalize URLs. The graph has 118,142,155 pages and 1,019,903,190 links, and was used, together with
uk-2002, in the experiments of the WebGraph compression papers.The node order is the one of the distributed (LLP-permuted) graph. Vertex property:
url, the URL of the page (for historical reasons, some URLs contain non-ASCII UTF-8 characters).
- Tags
- Informational Web graph Unweighted
- Added
- 2026-10-25
- Citation
-
- J. Hirai, S. Raghavan, H. Garcia-Molina, and A. Paepcke, "WebBase: a repository of Web pages." Computer Networks 33(1-6), 277-293 (2000). 10.1016/S1389-1286(00)00063-3 Sci-Hub
- P. Boldi and S. Vigna, "The WebGraph framework I: compression techniques." Proceedings of the 13th International Conference on World Wide Web (WWW 2004), 595-602 (2004). 10.1145/988672.988752 Sci-Hub
- P. Boldi, M. Rosa, M. Santini, and S. Vigna, "Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks." Proceedings of the 20th International Conference on World Wide Web (WWW 2011), 587-596 (2011). 10.1145/1963405.1963488 Sci-Hub
- Upstream URL OK
- http://data.law.di.unimi.it/webdata/webbase-2001/
- Networks
-
Tip: hover over a column header for a description.
Column legend
- $\left<k\right>$
- Mean degree
- $\sigma_k$
- Standard deviation of the degrees
- $\lambda_h$
- Largest eigenvalue of the Hashimoto (non-backtracking) matrix
- $\tau$
- Random walk mixing time
- $r$
- Degree assortativity
- $c$
- Global clustering coefficient
- $\oslash$
- (Pseudo-) diameter
- $S$
- Relative size of the largest component
- NPs
- Node properties
- EPs
- Edge properties