Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs

02/19/2020
by   Jieming Shi, et al.
0

Given a graph G and a node u in G, a single source SimRank query evaluates the similarity between u and every node v in G. Existing approaches to single source SimRank computation incur either long query response time, or expensive pre-computation, which needs to be performed again whenever the graph G changes. Consequently, to our knowledge none of them is ideal for scenarios in which (i) query processing must be done in realtime, and (ii) the underlying graph G is massive, with frequent updates. Motivated by this, we propose SimPush, a novel algorithm that answers single source SimRank queries without any pre-computation, and at the same time achieves significantly higher query processing speed than even the fastest known index-based solutions. Further, SimPush provides rigorous result quality guarantees, and its high performance does not rely on any strong assumption of the underlying graph. Specifically, compared to existing methods, SimPush employs a radically different algorithmic design that focuses on (i) identifying a small number of nodes relevant to the query, and subsequently (ii) computing statistics and performing residue push from these nodes only. We prove the correctness of SimPush, analyze its time complexity, and compare its asymptotic performance with that of existing methods. Meanwhile, we evaluate the practical performance of SimPush through extensive experiments on 8 real datasets. The results demonstrate that SimPush consistently outperforms all existing solutions, often by over an order of magnitude. In particular, on a commodity machine, SimPush answers a single source SimRank query on a web graph containing over 133 million nodes and 5.4 billion edges in under 62 milliseconds, with 0.00035 empirical error, while the fastest index-based competitor needs 1.18 seconds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2019

PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs

SimRank is a classic measure of the similarities of nodes in a graph. G...
research
08/28/2019

Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries

Given a graph G, a source node s and a target node t, the personalized P...
research
07/24/2023

Estimating Single-Node PageRank in Õ(min{d_t, √(m)}) Time

PageRank is a famous measure of graph centrality that has numerous appli...
research
06/21/2020

Personalized PageRank to a Target Node, Revisited

Personalized PageRank (PPR) is a widely used node proximity measure in g...
research
09/20/2017

ProbeSim: Scalable Single-Source and Top-k SimRank Computations on Dynamic Graphs

Single-source and top-k SimRank queries are two important types of simil...
research
03/03/2020

Just SLaQ When You Approximate: Accurate Spectral Distances for Web-Scale Graphs

Graph comparison is a fundamental operation in data mining and informati...
research
11/19/2021

An Index for Single Source All Destinations Distance Queries in Temporal Graphs

A typical task in temporal graphs analysis is answering single-source-al...

Please sign up or login with your details

Forgot password? Click here to reset