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

高效的半外部深度优先搜索

Efficient Semi-External Depth-First Search

Xiaolong Wan, Hongzhi Wang

摘要:

随着图形大小的快速增长,目前许多真实世界的图形很难加载到主存中。深度优先搜索(DFS)结果的计算成为一个热门话题,即,深度优先顺序或DFS树,半外部存储器模型。半外部算法假设主存至少能存储图G的一棵生成树T,并逐步将T重构为一棵非平凡的DFS-树。在本文中,我们提出了一个全面的研究半外部DFS问题。本文在分析了DFS算法存在的主要问题的基础上,提出了一种新的半外部DFS算法EP-DFS。与传统算法不同,我们专注于有效地解决这样复杂的问题,不仅具有更少的I/O,而且具有更简单的CPU计算(实现友好)和更少的随机I/O访问(关键效率)。在合成图和真实图上进行了广泛的实验评估。实验结果表明,我们的EP-DFS算法显着优于现有的算法。

英文摘要:

As the sizes of graphs grow rapidly, currently many real-world graphs can hardly be loaded in the main memory. It becomes a hot topic to compute depth-first search (DFS) results, i.e., depth-first order or DFS-Tree, on semi-external memory model. Semi-external algorithms assume the main memory could at least hold a spanning tree T of a graph G, and gradually restructure T into a DFS-Tree, which is non-trivial. In this paper, we present a comprehensive study of semi-external DFS problem. Based on our theoretical analysis of its main challenge, we introduce a new semi-external DFS algorithm, named EP-DFS, with a lightweight index N+-index. Unlike traditional algorithms, we focus on addressing such complex problem efficiently not only with less I/Os, but also with simpler CPU calculation (implementation-friendly) and less random I/O accesses (key-to-efficiency). Extensive experimental evaluation is conducted on both synthetic and real graphs. The experimental results confirm that our EP-DFS algorithm significantly outperforms existing algorithms.

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

↑