简体繁体 English

泰坦和卡桑德拉的最短路径

[英]Shortest Path with Titan and Cassandra

原文 2014-10-18 17:14:45 5 1 cassandra/ titan/ tinkerpop/ faunus

Currently we are using Titan Graph DB with Cassandra as backend for a telecom application. 当前，我们将Titan Graph DB与Cassandra一起用作电信应用程序的后端。 The database consists of Network topology details. 该数据库由网络拓扑详细信息组成。 We have a requirement to calculate the shortest path between network nodes based on the Dijkstra algorithm. 我们需要基于Dijkstra算法来计算网络节点之间的最短路径。 Appreciate your suggestions on the following 1 We feel running iterative traversal across vertices using simple traversal will not be efficient , please suggest if map/reduce is the best option for this. 赞赏您对以下问题的建议1我们认为使用简单遍历在各个顶点之间进行迭代遍历效率不高，请建议使用map / reduce是对此的最佳选择。 2 Do we need to use Faunus for this requirement or the existing setup with Faunus jar/libraries will enable us to carry out this. 2我们需要使用Faunus来满足此要求吗，否则Faunus jar /库的现有设置将使我们能够执行此操作。 (With Furnace Dijkstra implementation??) （使用Furnace Dijkstra实现？）

Thanks in advance 提前致谢

1 个解决方案

For completeness, this question was answered in the Aurelius Graphs mailing list: 为了完整起见，在Aurelius Graphs邮件列表中回答了这个问题：

https://groups.google.com/forum/#!topic/aureliusgraphs/Im3y93YOkz0 https://groups.google.com/forum/#!topic/aureliusgraphs/Im3y93YOkz0

In short, Faunus is not the best tool for this job. 简而言之，Faunus并不是从事这项工作的最佳工具。 More discussion on this topic can be found here: 有关此主题的更多讨论可以在这里找到：

https://groups.google.com/d/msg/aureliusgraphs/67m_5Uc34Yk/CMVLsKLHYOwJ https://groups.google.com/d/msg/aureliusgraphs/67m_5Uc34Yk/CMVLsKLHYOwJ