DF* PageRank:用于动态图上更新PageRank的改进增量扩展方法
DF* PageRank: Improved Incrementally Expanding Approaches for Updating PageRank on Dynamic Graphs
AI总结:
本文提出改进的DF和DF-P方法,在动态图上高效更新PageRank,通过迭代识别可能改变排名的顶点,在64核服务器上相比现有方法最高提速15.2倍,并具有良好的线程扩展性。
摘要:
PageRank是一种广泛使用的中心性度量,通过考虑图中顶点的连接及其连接的重要性来评估顶点的重要性。由于数据集规模日益增大,在动态图上高效更新PageRank对各种应用至关重要。本技术报告介绍了我们改进的动态前沿(DF)和带剪枝的动态前沿(DF-P)方法。给定包含边插入和删除的批量更新,这些方法以最小开销迭代识别可能改变其排名的顶点。在配备64核AMD EPYC-7742处理器的服务器上,我们的方法在真实世界动态图上分别比静态和动态遍历PageRank快5.2倍/15.2倍和1.3倍/3.5倍,在具有随机批量更新的大型静态图上分别快7.2倍/9.6倍和4.0倍/5.6倍。此外,我们的方法在线程数每翻倍时性能提升1.8倍/1.7倍。
英文摘要:
PageRank is a widely used centrality measure that assesses the significance of vertices in a graph by considering their connections and the importance of those connections. Efficiently updating PageRank on dynamic graphs is essential for various applications due to the increasing scale of datasets. This technical report introduces our improved Dynamic Frontier (DF) and Dynamic Frontier with Pruning (DF-P) approaches. Given a batch update comprising edge insertions and deletions, these approaches iteratively identify vertices likely to change their ranks with minimal overhead. On a server featuring a 64-core AMD EPYC-7742 processor, our approaches outperform Static and Dynamic Traversal PageRank by 5.2x/15.2x and 1.3x/3.5x respectively - on real-world dynamic graphs, and by 7.2x/9.6x and 4.0x/5.6x on large static graphs with random batch updates. Furthermore, our approaches improve performance at a rate of 1.8x/1.7x for every doubling of threads.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。