Cache-Efficient Approach for Index-Free Personalized PageRank

Cache-Efficient Approach for Index-Free Personalized PageRank

Personalized PageRank (PPR) measures the importance of vertices with respect to a source vertex. Since real-world graphs are evolving rapidly, PPR computation methods need to be index-free and fast. Unfortunately, existing index-free methods suffer from cache misses. They follow the state-of-the-art...

Full description

Bibliographic Details
Main Authors: Kohei Tsuchida, Naoki Matsumoto, Andrew Shin, Kunitake Kaneko
Format: Article
Language:English
Published: IEEE 2023-01-01
Series:IEEE Access
Subjects:
Personalized pagerank
index-free
graph reordering
forward push
random walk monte-carlo simulation
Online Access:https://ieeexplore.ieee.org/document/10018394/

Internet

https://ieeexplore.ieee.org/document/10018394/

Similar Items