Parallel Online Ranking of Web Pages

  • Saffar Y
  • Esmaili K
 et al. 
  • 4

    Readers

    Mendeley users who have this article in their library.
  • 0

    Citations

    Citations of this article.

Abstract

Modern search engines use link structure of the World Wide Web in order to gain better results for ranking the results of users’ queries. One of the most popular ranking algorithms which is based on link analysis is HITS. It generates very accurate outputs but because of huge amount of online computations, this algorithm is relatively slow. In this paper we introduce PHITS, a parallelized version of the HITS algorithm that is suitable for working with huge web graphs in a reasonable time. For implementing this algorithm, we use WebGraph framework and we focus on parallelizing access to web graph as the main bottleneck in the HITS algorithm.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

  • SCOPUS: 2-s2.0-33750829693
  • SGR: 33750829693
  • ISBN: 1424402123
  • PUI: 44710936

Authors

  • Y. Ganji Saffar

  • Y. Ganji Saffar

  • K. Sheykh Esmaili

  • K. Sheykh Esmaili

  • Mohammad Ghodsi

  • Mohammad Ghodsi

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free