vesoft-inc / nebula

A distributed, fast open-source graph database featuring horizontal scalability and high availability
https://nebula-graph.io
Apache License 2.0
10.68k stars 1.2k forks source link

nGQL优化问题 #5845

Open AntarcticPresident opened 6 months ago

AntarcticPresident commented 6 months ago

match p=(v1:domain)-[]->(v2:ip)-[*]->(v3:lvsvs)-[]->(v4:service) where v1.domain.name in ["domain1","domain2","domain3"] and v2.ip.ip in ["8.8.8.8"] and v3.lvsvs.ip in ["8.8.8.8"] return p 这个语句在我的服务器上执行耗时21秒。 如果说domain只有一个,就能降到1秒以内。有没大佬帮忙分析下,这个怎么写能快一点,或者指点下,整个逻辑中哪部分特别耗时?

QingZ11 commented 5 months ago

你可以参考下面的链接,将对应的执行计划贴一下,看下具体的耗时点是在哪里。

https://discuss.nebula-graph.com.cn/t/topic/11938

You can refer to the link above and provide the corresponding execution plan to identify the specific points of time consumption.