-
Notifications
You must be signed in to change notification settings - Fork 1.2k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
nGQL优化问题 #5845
Labels
type/question
Type: question about the product
Comments
你可以参考下面的链接,将对应的执行计划贴一下,看下具体的耗时点是在哪里。 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. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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秒以内。有没大佬帮忙分析下,这个怎么写能快一点,或者指点下,整个逻辑中哪部分特别耗时?
The text was updated successfully, but these errors were encountered: