O'Reach:在大型图中更快的可达性
O'Reach: Even Faster Reachability in Large Graphs
摘要:
可达性问题是计算机科学中最基本的问题之一:给定一个有向图和两个顶点s和t,s能通过一条路径到达t吗?我们重新审视现有的技术,并将它们与新的方法相结合,以支持在恒定的时间使用线性大小的可达性索引的可达性查询的很大一部分。我们的新算法O'Reach可以很容易地与以前开发的解决方案相结合,或独立运行。在一个详细的实验研究中,我们比较了各种算法的索引建设和查询时间,以及他们的内存足迹上的一组不同的实例。我们的实验表明,查询性能往往不仅强烈依赖于图的类型,而且还依赖于结果,即,可达或不可达。此外,我们表明,以前的算法显着加快时,结合我们的新方法在几乎所有的情况下。令人惊讶的是,由于缓存效应,在空间上的更高投资不一定会得到回报:在预先计算的完整可达性矩阵中,可达性查询通常可以比单次内存访问更快地得到回答。
英文摘要:
One of the most fundamental problems in computer science is the reachability problem: Given a directed graph and two vertices s and t, can s reach t via a path? We revisit existing techniques and combine them with new approaches to support a large portion of reachability queries in constant time using a linear-sized reachability index. Our new algorithm O'Reach can be easily combined with previously developed solutions for the problem or run standalone. In a detailed experimental study, we compare a variety of algorithms with respect to their index-building and query times as well as their memory footprint on a diverse set of instances. Our experiments indicate that the query performance often depends strongly not only on the type of graph, but also on the result, i.e., reachable or unreachable. Furthermore, we show that previous algorithms are significantly sped up when combined with our new approach in almost all scenarios. Surprisingly, due to cache effects, a higher investment in space doesn't necessarily pay off: Reachability queries can often be answered even faster than single memory accesses in a precomputed full reachability matrix.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。