arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.04015cs.DC
收藏

大规模并行单源 SimRanks 在 $o(\log n)$ 轮次内的计算

Massively Parallel Single-Source SimRanks in $o(\log n)$ Rounds

Siqiang Luo, Zulun Zhu

AI总结:

本文在MPC模型中研究单源SimRank计算,提出首个仅需 $O(\log^2 \log n)$ 通信轮次和亚线性机器空间即可克服 $Θ(\log n)$ 轮次复杂度障碍的分布式算法。

摘要:

SimRank 是评估图中两个节点间结构相似性的最基础度量之一,已被应用于大量数据管理任务中。这些任务通常涉及单源 SimRank 计算,即评估源节点 $s$ 与所有其他节点之间的 SimRank 值。由于其计算复杂度极高,大型图的单源 SimRank 计算极具挑战性,因此近期研究转向分布式处理。令人惊讶的是,尽管 SimRank 已被广泛采用二十年,但关于分布式 SimRank 具有可证明结果的理论方面却鲜少被研究。本文在大规模并行计算(MPC)模型中对单源 SimRank 计算进行了理论研究,该模型是建模 MapReduce、Hadoop 或 Spark 等分布式系统的标准理论框架。现有的分布式 SimRank 算法对于具有 $n$ 个节点的图,要么强制要求 $Ω(\log n)$ 的通信轮次复杂度,要么要求 $Ω(n)$ 的机器空间。我们克服了这一障碍。具体而言,给定一个具有 $n$ 个节点的图,对于任意查询节点 $v$ 和常数误差 $ε>\frac{3}{n}$,我们证明在机器间使用 $O(\log^2 \log n)$ 轮通信几乎足以计算绝对误差最多为 $ε$ 的单源 SimRank 值,同时每台机器仅需与 $n$ 呈亚线性关系的空间。据我们所知,这是 MPC 中首个能够以可证明的结果精度克服 $Θ(\log n)$ 轮次复杂度障碍的单源 SimRank 算法。

英文摘要:

SimRank is one of the most fundamental measures that evaluate the structural similarity between two nodes in a graph and has been applied in a plethora of data management tasks. These tasks often involve single-source SimRank computation that evaluates the SimRank values between a source node $s$ and all other nodes. Due to its high computation complexity, single-source SimRank computation for large graphs is notoriously challenging, and hence recent studies resort to distributed processing. To our surprise, although SimRank has been widely adopted for two decades, theoretical aspects of distributed SimRanks with provable results have rarely been studied. In this paper, we conduct a theoretical study on single-source SimRank computation in the Massive Parallel Computation (MPC) model, which is the standard theoretical framework modeling distributed systems such as MapReduce, Hadoop, or Spark. Existing distributed SimRank algorithms enforce either $Ω(\log n)$ communication round complexity or $Ω(n)$ machine space for a graph of $n$ nodes. We overcome this barrier. Particularly, given a graph of $n$ nodes, for any query node $v$ and constant error $ε>\frac{3}{n}$, we show that using $O(\log^2 \log n)$ rounds of communication among machines is almost enough to compute single-source SimRank values with at most $ε$ absolute errors, while each machine only needs a space sub-linear to $n$. To the best of our knowledge, this is the first single-source SimRank algorithm in MPC that can overcome the $Θ(\log n)$ round complexity barrier with provable result accuracy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑