Skip to main content
SpringerLink
Log in

On the Stability of Web Crawling and Web Search

  • Conference paper
Algorithms and Computation (ISAAC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5369))

Included in the following conference series:

Abstract

In this paper, we analyze a graph-theoretic property motivated by web crawling. We introduce a notion of stable cores, which is the set of web pages that are usually contained in the crawling buffer when the buffer size is smaller than the total number of web pages. We analyze the size of core in a random graph model based on the bounded Pareto power law distribution. We prove that a core of significant size exists for a large range of parameters 2 < α< 3 for the power law.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Comput. Netw. ISDN Syst. 30, 107–117 (1998)

    Article  Google Scholar 

  2. Bollobas, B., Riordan, O., Spencer, J., Tusnady, G.: The degree sequence of a scale-free random process. Random Structures and Algorithms 18, 279–290 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Castillo, C.: Effective Web Crawling, Ph.D. Thesis, University of Chile (2004)

    Google Scholar 

  4. Chung, F., Lu, L.: Complex Graphs and Networks. AMS (2007)

    Google Scholar 

  5. Faloutsos, C., Faloutsos, M., Faloutsos, P.: On power-law relationships of the internee topology. In: Proc. SIGCOMM (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research, USA

    Reid Anderson, Christian Borgs & Jennifer Chayes

  2. Cornell University, USA

    John Hopcroft

  3. Google Research, USA

    Vahab Mirrokni

  4. Boston University, USA

    Shang-Hua Teng

Authors
  1. Reid Anderson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Borgs
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jennifer Chayes
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. John Hopcroft
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Vahab Mirrokni
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Shang-Hua Teng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Technologies, University of Sydney, Australia

    Seok-Hee Hong

  2. Graduate School of Informatics, Kyoto University, 606-8501, Kyoto, Japan

    Hiroshi Nagamochi

  3. Graduate School of Informatics, Kyoto University, Japan

    Takuro Fukunaga

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anderson, R., Borgs, C., Chayes, J., Hopcroft, J., Mirrokni, V., Teng, SH. (2008). On the Stability of Web Crawling and Web Search. In: Hong, SH., Nagamochi, H., Fukunaga, T. (eds) Algorithms and Computation. ISAAC 2008. Lecture Notes in Computer Science, vol 5369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92182-0_60

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92182-0_60

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92181-3

  • Online ISBN: 978-3-540-92182-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation