DDSL:分布式动态图上的高效子图列表
DDSL: Efficient Subgraph Listing on Distributed and Dynamic Graphs
摘要:
子图列表是图论中的一个基本问题,在社会学、化学、社交网络等领域有着广泛的应用。现代图通常具有大规模和高动态性的特点,这对现有的子图列表算法的效率提出了挑战。最近的工作已经显示出在分布式系统中划分和处理大图的好处,然而,在分布式环境中,只有很少的工作目标子图在动态图上列出。在本文中,我们提出了一种有效的方法,称为分布式和动态子图列表(DDSL),它可以增量更新的结果,而不是从头开始运行。DDSL遵循通用的分布式连接框架。在这个框架中,我们使用一个邻居保持存储的数据图,这需要有界的额外空间,并支持动态更新。在此基础上,我们提出了一个综合成本模型来估计列出子图的I/O成本。然后,基于这个成本模型,我们开发了一个算法,找到一个给定的模式的最佳连接树。为了处理动态图,我们提出了一个有效的左深连接算法,以增量更新连接结果。在真实世界的数据集上进行了大量的实验。结果表明,DDSL在处理静态和动态图时,在响应时间方面优于现有的方法。
英文摘要:
Subgraph listing is a fundamental problem in graph theory and has wide applications in areas like sociology, chemistry, and social networks. Modern graphs can usually be large-scale as well as highly dynamic, which challenges the efficiency of existing subgraph listing algorithms. Recent works have shown the benefits of partitioning and processing big graphs in a distributed system, however, there is only few work targets subgraph listing on dynamic graphs in a distributed environment. In this paper, we propose an efficient approach, called Distributed and Dynamic Subgraph Listing (DDSL), which can incrementally update the results instead of running from scratch. DDSL follows a general distributed join framework. In this framework, we use a Neighbor-Preserved storage for data graphs, which takes bounded extra space and supports dynamic updating. After that, we propose a comprehensive cost model to estimate the I/O cost of listing subgraphs. Then based on this cost model, we develop an algorithm to find the optimal join tree for a given pattern. To handle dynamic graphs, we propose an efficient left-deep join algorithm to incrementally update the join results. Extensive experiments are conducted on real-world datasets. The results show that DDSL outperforms existing methods in dealing with both static dynamic graphs in terms of the responding time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。