Local Structure in the Web

Abstract : The web graph has been widely adopted as the core describing the web structure [4]. However, little attention has been paid to the relationship betweenthe web graph and the location of the pages. It has already been noticed that links are often local (i.e. from a page to another page of the same server) and this can be used for efficient encoding of the web graph [9,7]. Locality in the web can be further modelled by the clustered graph induced by the prefix tree of URLs. The web tree's internal nodes are the commonprefixes of URLs and its leaves are the URLs themselves. A prefix ordering of URLs according to this tree allows to observe local structure in the web directly on the adjacency matrix M of the web graph. M splits in two terms : M = D + S, where D is diagonal by blocks and S is a very sparse matrix. The blocks of D that can be observed along the diagonal are sets of pages strongly related together.
Complete list of metadatas

https://hal.inria.fr/inria-00471711
Contributor : Laurent Viennot <>
Submitted on : Thursday, April 8, 2010 - 5:51:55 PM
Last modification on : Friday, January 4, 2019 - 5:32:57 PM
Long-term archiving on : Friday, July 9, 2010 - 9:21:07 PM

Files

www2003.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00471711, version 1

Citation

Fabien Mathieu, Laurent Viennot. Local Structure in the Web. 12th international conference on the World Wide Web, May 2003, Budapest, Hungary. 2003. ⟨inria-00471711⟩

Share

Metrics

Record views

307

Files downloads

207