Loading...

Parallel online ranking of web pages

Ganji Saffar, Y ; Sharif University of Technology | 2006

310 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/aiccsa.2006.205075
  3. Publisher: IEEE Computer Society , 2006
  4. Abstract:
  5. 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. © 2006 IEEE
  6. Keywords:
  7. Algorithms ; Computational methods ; Computer graphics ; Indexing (of information) ; Query languages ; Search engines ; Websites ; Online ranking ; Ranking algorithms ; Web graphs ; Online searching
  8. Source: IEEE International Conference on Computer Systems and Applications, 2006, Sharjah, 8 March 2006 through 8 March 2006 ; Volume 2006 , 2006 , Pages 104-109 ; 1424402123 (ISBN); 9781424402120 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/1618340