问题描述
我目前正在使用 Cosmos DB Graph 创建一个 PoC.数据本身大约有 10 万个节点和 63 万条边.在此数据的一个子集中(1.7k 节点和 3.8k 边)中，我试图用 gremlin 找到从 A 到 B 的最短路径.
I am currently creating a PoC using Cosmos DB Graph. The data itself is around 100k nodes and 630k edges.In one subset of this data (1.7k nodes and 3.8k edges) I am trying to find the shortest path from A to B with the gremlin.
不知何故，这是不可能的.我得到一个查询超时(30 秒)或我得到一个循环错误(不能超过 32 个循环)！?！?一定有什么问题(在我这边或 Cosmos 这边) - 你能帮忙或给一个提示吗?我已经尝试了很多查询变体，但错误仍然存在......我尝试过的基本查询之一
Somehow this is not possible.I get a query timeout (30 seconds) or I get a loop error (cannot exceed 32 loops) !?!?There must be something wrong (on my side or Cosmos side) - can you please help or give a hint?I tried a lot of query variants already, but the errors are still there...One of the basic queries I tried
推荐答案
Gremlin API 服务的限制记录在此处:https://docs.microsoft.com/en-us/azure/cosmos-db/gremlin-limits
The limits of the Gremlin API service are documented here: https://docs.microsoft.com/en-us/azure/cosmos-db/gremlin-limits
您可能需要寻找一个 OLAP 引擎来处理如此大的最短路径查询.您可以考虑使用 Spark 及其 GraphFrame 支持来处理它.这是一个示例:https://github.com/Azure/azure-cosmosdb-spark/blob/2.4/samples/graphframes/main.scala
It may be necessary that you are looking for an OLAP engine to process such a large shortest path query. You could consider Spark and their GraphFrame support to process it. Here is a sample: https://github.com/Azure/azure-cosmosdb-spark/blob/2.4/samples/graphframes/main.scala
这篇关于Cosmos DB Gremlin 查询超时的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！