arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1205.6691cs.DB
收藏

十亿结点图的高效子图匹配

Efficient Subgraph Matching on Billion Node Graphs

Zhao Sun, Hongzhi Wang, Haixun Wang, Bin Shao, Jianzhong Li

摘要:

处理大规模图形数据的能力对于越来越多的应用程序至关重要。许多工作一直致力于支持基本的图操作,如子图匹配,可达性,正则表达式匹配等,在许多情况下,图索引被用来加快查询处理。通常,大多数索引需要超线性索引时间或超线性索引空间。不幸的是,对于非常大的图,超线性方法几乎总是不可行的。本文研究了十亿节点图的子图匹配问题。我们提出了一种新的算法,支持高效的子图匹配部署在分布式存储器上的图形。我们使用高效的图探索和大规模并行计算来进行查询处理,而不是依赖于超线性索引。我们的实验结果证明了在网络规模的图数据上进行子图匹配的可行性。

英文摘要:

The ability to handle large scale graph data is crucial to an increasing number of applications. Much work has been dedicated to supporting basic graph operations such as subgraph matching, reachability, regular expression matching, etc. In many cases, graph indices are employed to speed up query processing. Typically, most indices require either super-linear indexing time or super-linear indexing space. Unfortunately, for very large graphs, super-linear approaches are almost always infeasible. In this paper, we study the problem of subgraph matching on billion-node graphs. We present a novel algorithm that supports efficient subgraph matching for graphs deployed on a distributed memory store. Instead of relying on super-linear indices, we use efficient graph exploration and massive parallel computing for query processing. Our experimental results demonstrate the feasibility of performing subgraph matching on web-scale graph data.

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

↑