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

分布式子图匹配技术综述及实验分析

A Survey and Experimental Analysis of Distributed Subgraph Matching

Longbin Lai, Zhu Qing, Zhengyi Yang, Xin Jin, Zhengmin Lai, Ran Wang, Kongzhang Hao, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang, Zhengping Qian, Jingren Zhou

摘要:

近年来,出现了许多分布式算法,旨在解决大规模的子图匹配问题。现有的算法级比较未能提供一个系统的观点,每个算法的利弊,主要是由于战略和优化的交织。在本文中,我们确定了四个战略和三个通用的优化,从代表国家的最先进的作品。我们实现了四种策略,并基于常见的Timely Challow-low系统进行了优化,以进行系统的策略级比较。我们的实现涵盖了所有的表示算法。我们进行了大量的实验,无标记匹配和标记匹配的分布式子图匹配在各种设置下的性能进行了分析,最后总结为一个实用的指导。

英文摘要:

Recently there emerge many distributed algorithms that aim at solving subgraph matching at scale. Existing algorithm-level comparisons failed to provide a systematic view to the pros and cons of each algorithm mainly due to the intertwining of strategy and optimization. In this paper, we identify four strategies and three general-purpose optimizations from representative state-of-the-art works. We implement the four strategies with the optimizations based on the common Timely dataflow system for systematic strategy-level comparison. Our implementation covers all representation algorithms. We conduct extensive experiments for both unlabelled matching and labelled matching to analyze the performance of distributed subgraph matching under various settings, which is finally summarized as a practical guide.

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

↑