skip to main content
article

Decoding the structure of the WWW: A comparative analysis of Web crawls

Authors Info & Claims
Published:01 August 2007Publication History
Skip Abstract Section

Abstract

The understanding of the immense and intricate topological structure of the World Wide Web (WWW) is a major scientific and technological challenge. This has been recently tackled by characterizing the properties of its representative graphs, in which vertices and directed edges are identified with Web pages and hyperlinks, respectively. Data gathered in large-scale crawls have been analyzed by several groups resulting in a general picture of the WWW that encompasses many of the complex properties typical of rapidly evolving networks. In this article, we report a detailed statistical analysis of the topological properties of four different WWW graphs obtained with different crawlers. We find that, despite the very large size of the samples, the statistical measures characterizing these graphs differ quantitatively, and in some cases qualitatively, depending on the domain analyzed and the crawl used for gathering the data. This spurs the issue of the presence of sampling biases and structural differences of Web crawls that might induce properties not representative of the actual global underlying graph. In short, the stability of the widely accepted statistical description of the Web is called into question. In order to provide a more accurate characterization of the Web graph, we study statistical measures beyond the degree distribution, such as degree-degree correlation functions or the statistics of reciprocal connections. The latter appears to enclose the relevant correlations of the WWW graph and carry most of the topological information of the Web. The analysis of this quantity is also of major interest in relation to the navigability and searchability of the Web.

References

  1. Adamic, L. A. and Huberman, B. A. 2001. The Web's hidden order. Commun. ACM 44, 9, 55--60. Google ScholarGoogle Scholar
  2. Albert, R., Jeong, H., and Barabási, A.-L. 1999. Diameter of the World-Wide Web. Nature 401, 6749, 130--131.Google ScholarGoogle Scholar
  3. Arasu, A., Cho, J., Garcia-Molina, H., Paepcke, A., and Raghavan, S. 2001. Searching the Web. ACM Trans. Internet Tech. 1, 1, 2--43. Google ScholarGoogle Scholar
  4. Bar-Yossef, Z., Berg, A., Chien, S., Fakcharoenphol, J., and Weitz, D. 2000. Approximating aggregate queries about web pages via random walks. In Proceedings of the 26th International Conference on Very Large Data Bases (VLDB). 535--544. Google ScholarGoogle Scholar
  5. Barabási, A.-L. and Albert, R. 1999. Emergence of scaling in random networks. Science 286, 5439, 509--512.Google ScholarGoogle Scholar
  6. Barabási, A.-L., Albert, R., and Jeong, H. 2000. Scale-free characteristics of random networks: The topology of the World-Wide Web. Physica A 281, 1-4, 69--77.Google ScholarGoogle Scholar
  7. Barrat, A., Barthélemy, M., and Vespignani, A. 2004. Traffic-driven model of the World Wide Web graph, Stephano Leonardi, Ed. Algorithms and Models for the Web-Graph. Lecture Notes in Computer Science, vol. 3243. Springer, Berlin, Heidelburg, Germany, 56--67.Google ScholarGoogle Scholar
  8. Boguñá, M. and Serrano, M. A. 2005. Generalized percolation in random directed networks. Phys. Rev. E 72, 1, 016106.Google ScholarGoogle Scholar
  9. Boldi, P., Codenotti, B., Santini, M., and Vigna, S. 2004. Ubicrawler: A scalable fully distributed Web crawler. Softw. Pract. Exper. 34, 8, 711--726. Google ScholarGoogle Scholar
  10. Boldi, P. and Vigna, S. 2004. The Webgraph framework i: Compression techniques. In WWW 2004 Conference Proceedings. ACM, New York, NY, 595--601. Google ScholarGoogle Scholar
  11. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, S., Tomkins, A., and Wiener, J. 2000. Graph structure in the Web. Comput. Netw. 33, 1-6, 309--320. Google ScholarGoogle Scholar
  12. Cho, J. and Garcia-Molina, H. 2000. The evolution of the Web and implications for an incremental crawler. In Proceedings of the 26th International Conference on Very Large Databases (Cairo, Egypt). 200--209. Google ScholarGoogle Scholar
  13. Cohen, R., Erez, K., ben Avraham, D., and Havlin, S. 2000. Resilience of the Internet to random breakdown. Phys. Rev. Lett. 85, 21, 4626.Google ScholarGoogle Scholar
  14. Cothey, V. 2004. Web-crawling reliability. J. Amer. Soc. Inform. Sci. Techn. 55, 14, 1228--1238. Google ScholarGoogle Scholar
  15. Dill, S., Kumar, R., McCurley, K., Rajagopalan, S., Sivakumar, D., and Tomkins, A. 2001. Self-similarity in the Web. In Proceedings of the 27th International Conference on Very Large Data Bases (VLDB). 69--78. Google ScholarGoogle Scholar
  16. Donato, D., Laura, L., Leonardi, S., and Millozzi, S. 2004. Large scale properties of the Webgraph. Eur. Phys. J. B 38, 2, 239--243.Google ScholarGoogle Scholar
  17. Donato, D., Leonardi, S., Millozzi, S., and Tsaparas, P. 2005. Mining the inner structure of the Web graph. In Proceedings of the Eighth International Workshop on the Web and Databases (WebDB). 145--150.Google ScholarGoogle Scholar
  18. Dorogovtsev, S. N. and Mendes, J. F. F. 2003. Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford University Press, Oxford, U. K. Google ScholarGoogle Scholar
  19. Eckmann, J. P. and Moses, E. 2002. Curvature of co-links uncovers hidden thematic layers in the World Wide Web. Procc. Natl. Acad. Sci. 99, 9, 5825--5829.Google ScholarGoogle Scholar
  20. Fortunato, S., Boguñá, M., Flammini, A., and Menczer, F. 2006. Approximating pagerank from in-degree. In cs.IR/0511016, presented at the Fourth Workshop on Algorithms and Models for the Web-Graph, Nov. 30 -- Dec. 1, Banff, Alta., (Canada).Google ScholarGoogle Scholar
  21. Garlaschelli, D. and Loffredo, M. I. 2004. Patterns of link reciprocity in directed networks. Phys. Rev. Lett. 93, 26, 268701.Google ScholarGoogle Scholar
  22. Gulli, A. and Signorini, A. 2005. The indexable Web is more than 11.5 billion pages. In WWW 2005 Conference Proceedings (Chiba, Japan). ACM Press, New York, NY, 902--903. Google ScholarGoogle Scholar
  23. Henzinger, M. R., Heydon, A., Mitzenmacher, M., and Najork, M. 2000. On near-uniform URL sampling. In WWW 2000 Conference Proceedings (Amsterdam, The Netherlands). ACM Press, New York, NY, 295--308. Google ScholarGoogle Scholar
  24. Hirai, J., Raghavan, S., Paepcke, A., and Garcia-Molina, H. 2000. Webbase: A repository of Web pages. In WWW 2000 Conference Proceedings (Amsterdam, The Netherlands). ACM Press, New York, NY, 277--293. Google ScholarGoogle Scholar
  25. Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., and Upfal, E. 2000. Stochastic models for the Web graph. In Proceedings of the 41th IEEE Symposium on Foundations of Computer Science (FOCS). 57--65. Google ScholarGoogle Scholar
  26. Kumar, R., Raghavan, P., Rajagopalan, S., and Tomkins, A. 1999. Trawling emerging cyber-communities automatically. In WWW 1999 Conference Proceedings (Toronto, Ont., Canada). ACM Press, New York, NY, 3--4. Google ScholarGoogle Scholar
  27. Lawrence, S. and Giles, C. L. 1998. Searching the world wide web. Science 280, 5360, 98--100.Google ScholarGoogle Scholar
  28. Lawrence, S. and Giles, C. L. 1999. Accessibility of information on the Web. Nature 400, 6740, 107--109. Google ScholarGoogle Scholar
  29. Mahadevan, P., Krioukov, D., Fall, K., and Vahdat, A. 2006. Systematic topology analysis and generation using degree correlations. In Proceedings of SIGCOMM06 (Pisa, Italy). ACM Press, New York, NY. Google ScholarGoogle Scholar
  30. Mossa, S., Barthélemy, M., Stanley, H. E., and Amaral, L. A. N. 2002. Truncation of power law behavior in scale-free network models due to information filtering. Phys. Rev. Lett. 88, 13, 138701.Google ScholarGoogle Scholar
  31. Newman, M. E. J. 2002. Assortative mixing in networks. Phys. Rev. Lett. 89, 20, 208701.Google ScholarGoogle Scholar
  32. Pastor-Satorras, R., Vázquez, A., and Vespignani, A. 2001. Dynamical and correlation properties of the Internet. Phys. Rev. Lett. 87, 25, 258701.Google ScholarGoogle Scholar
  33. Pastor-Satorras, R. and Vespignani, A. 2001. Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86, 14, 3200--3203.Google ScholarGoogle Scholar
  34. Pastor-Satorras, R. and Vespignani, A. 2004. Evolution and Structure of the Internet. A Statistical Physics Approach. Cambridge University Press, Cambridge, U. K. Google ScholarGoogle Scholar
  35. Pennock, D. M., Flake, G. W., Lawrence, S., Glover, E. J., and Giles, C. L. 2002. Winners don't take all: Characterizing the competition for links on the web. Proc. Natl. Acad. Sci. 99, 8, 5207--5211.Google ScholarGoogle Scholar
  36. Rusmevichientong, P., Pennock, D. M., Lawrence, S., and Giles, C. L. 2001. Methods for sampling pages uniformly from the World Wide Web. In Proceedings of the AAAI Fall Symposium on Using Uncertainty Within Computation. 121--128.Google ScholarGoogle Scholar

Index Terms

  1. Decoding the structure of the WWW: A comparative analysis of Web crawls

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!