Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings
Discussion options

在使用中发现,如果数据量一大,查询的调用步数一多,就查不出结果了,不知道对图数据库优化能不能解决这个问题
优化的方向有这么几个

  1. 把neo4j “优化” 掉,换成其他图数据库,主要考虑的是多跳的查询性能
  2. 从建索引,优化查询语句,以空间换时间,修改neo4j配置等方面进行优化

有没有这方面有经验,或者对这感兴趣的同学,可以帮忙动手测试一下 🙌

You must be logged in to vote

Replies: 6 comments

Comment options

waderwu
Mar 28, 2022
Maintainer Author

有一些图数据库厂商自己会发布一些测试报告,比如 https://www.galaxybase.com/report/developer 看着效果好像还可以

You must be logged in to vote
0 replies
Comment options

waderwu
Mar 28, 2022
Maintainer Author

《我在学习和实践图数据库 Neo4j 的漫漫成长路》https://vancir.github.io/the-journey-of-learning-neo4j.html
这篇文章里面提到的优化建议应该有用

You must be logged in to vote
0 replies
Comment options

waderwu
Mar 28, 2022
Maintainer Author

昨天尝试了一天发现效果不明显,决定还是先引入最短路径,减少节点数量和环的出现,来临时解决问题。

You must be logged in to vote
0 replies
Comment options

waderwu
Mar 31, 2022
Maintainer Author

利用最短路径优化了一下,具体代码见分支 https://github.com/BytecodeDL/ByteCodeDL/tree/cha-optimization

You must be logged in to vote
0 replies
Comment options

waderwu
Apr 19, 2022
Maintainer Author

查找两点之间的所有路径是个NP hard问题,我觉得可以尝试使用启发式算法,返回有限条路径,有空的可以研究研究

You must be logged in to vote
0 replies
Comment options

neo4j可以参考tabby来为neo4j建立索引的方案。

You must be logged in to vote
0 replies
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
2 participants
Morty Proxy This is a proxified and sanitized view of the page, visit original site.