期刊名称：International Journal of Security and Its Applications
印刷版ISSN：1738-9976
出版年度：2015
卷号：9
期号：11
页码：231-248
DOI：10.14257/ijsia.2015.9.11.22
出版社：SERSC
摘要：The traditional PageRank algorithm can't efficiently dispose large data Webpage scheduling problem. This paper proposes an accelerated algorithm named topK-Rank .It is based on PageRank on the MapReduce platform. Owing to this algorithm ,Top k nodes can be found efficiently for a given graph without sacrificing accuracy. It can iteratively estimate lower/upper bounds of PageRank scores, and construct subgraphs in each iteration by pruning unnecessary nodes and edges. Theoretical analysis shows that this method guarantees result exactness. Experiments show that it can find top k nodes much faster than the existing approaches.
