Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on Computational Science

ICCS 2007: Computational Science – ICCS 2007 pp 237–244Cite as

  1. Home
  2. Computational Science – ICCS 2007
  3. Conference paper
An Efficient Algorithm and Its Parallelization for Computing PageRank

An Efficient Algorithm and Its Parallelization for Computing PageRank

  • Jonathan Qiao1,
  • Brittany Jones1 &
  • Stacy Thrall1 
  • Conference paper

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

Abstract

In this paper, an efficient algorithm and its parallelization to compute PageRank are proposed. There are existing algorithms to perform such tasks. However, some algorithms exclude dangling nodes which are an important part and carry important information of the web graph. In this work, we consider dangling nodes as regular web pages without changing the web graph structure and therefore fully preserve the information carried by them. This differs from some other algorithms which include dangling nodes but treat them differently from regular pages for the purpose of efficiency. We then give an efficient algorithm with negligible overhead associated with dangling node treatment. Moreover, the treatment poses little difficulty in the parallelization of the algorithm.

Keywords

  • PageRank
  • power method
  • dangling nodes
  • algorithm

Download conference paper PDF

References

  1. Brin, S., Page, L., Motwami, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical report, Computer Science Department, Stanford University (1999)

    Google Scholar 

  2. Langville, A.N., Meyer, C.D.: Deeper inside pagerank. Internet Math. 1, 335–380 (2004)

    MATH  MathSciNet  Google Scholar 

  3. Haveliwala, T.H., Kamvar, S.D.: The second eigenvalue of the google matrix. Technical report, Computer Science Department, Stanford University (2003)

    Google Scholar 

  4. Elden, L.: A note on the eigenvalues of the google matrix. Report LiTH-MAT-R-04-01 (2003)

    Google Scholar 

  5. Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Extrapolation methods for accelerating pagerank computations. In: Twelfth International World Wide Web Conference (2003)

    Google Scholar 

  6. Randall, K., Stata, R., Wickremesinghe, R., Wiener, J.: The link database: Fast access to graphs of the web. In: The IEEE Data Compression Conference (March 2002)

    Google Scholar 

  7. Adler, M., Mitzenmacher, M.: Towards compressing web graphs. In: The IEEE Data Compression Conference (March 2001)

    Google Scholar 

  8. Raghavan, S., Garcia-Molina, H.: Representing web graphs. In: The 19th IEEE Conference on Data Engineering, Bangalore, India (March 2003)

    Google Scholar 

  9. Haveliwala, T.H.: Efficient computation of pagerank. Technical report, Computer Science Department, Stanford University (Oct. 1999)

    Google Scholar 

  10. Chen, Y., Gan, Q., Suel, T.: I/o-efficient techniques for computing pagerank. In: Proc. of the 11th International Conference on Information and Knowledge Management (2002)

    Google Scholar 

  11. Kamvar, S., Haveliwala, T., Golub, G.: Adaptive methods for the computation of pagerank. Technical report, Stanford University (2003)

    Google Scholar 

  12. Lee, C., Golub, G., Zenios, S.: A fast two-stage algorithm for computing pagerank and its extension. Technical report, Stanford University (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Converse College Spartanburg, SC 29302, USA

    Jonathan Qiao, Brittany Jones & Stacy Thrall

Authors
  1. Jonathan Qiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Brittany Jones
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stacy Thrall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

    Rights and permissions

    Reprints and Permissions

    Copyright information

    © 2007 Springer Berlin Heidelberg

    About this paper

    Cite this paper

    Qiao, J., Jones, B., Thrall, S. (2007). An Efficient Algorithm and Its Parallelization for Computing PageRank. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2007. ICCS 2007. Lecture Notes in Computer Science, vol 4487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72584-8_31

    Download citation

    • .RIS
    • .ENW
    • .BIB
    • DOI: https://doi.org/10.1007/978-3-540-72584-8_31

    • Publisher Name: Springer, Berlin, Heidelberg

    • Print ISBN: 978-3-540-72583-1

    • Online ISBN: 978-3-540-72584-8

    • eBook Packages: Computer ScienceComputer Science (R0)

    Share this paper

    Anyone you share the following link with will be able to read this content:

    Sorry, a shareable link is not currently available for this article.

    Provided by the Springer Nature SharedIt content-sharing initiative

    Search

    Navigation

    • Find a journal
    • Publish with us

    Discover content

    • Journals A-Z
    • Books A-Z

    Publish with us

    • Publish your research
    • Open access publishing

    Products and services

    • Our products
    • Librarians
    • Societies
    • Partners and advertisers

    Our imprints

    • Springer
    • Nature Portfolio
    • BMC
    • Palgrave Macmillan
    • Apress
    • Your US state privacy rights
    • Accessibility statement
    • Terms and conditions
    • Privacy policy
    • Help and support

    167.114.118.210

    Not affiliated

    Springer Nature

    © 2023 Springer Nature