hugegraph在进行出度遍历时存在性能问题 #39

Activity

1. javeme

   assigned

   zhoney

   on Aug 30, 2018
2. zhoney commented on Aug 31, 2018

   

   zhoney

   on Aug 31, 2018

   Contributor

   More actions

   g.V().hasId("xxx").repeat(out("look")).until(outE("look").count().is(0)).path()

   执行时间长可能的原因：

   1. 这条语句通过广度优先进行层层搜索，每一层都查询了满足条件的顶点和边，有一定的访问量。
   2. 图本身有环路，导致大量循环，建议 repeat(out("look")) -> repeat(out("look").simplePath())
   3. 存储后端本身速度慢
      可以按此排查一下问题

   另外，对于第一条，我们开发了一个subgraphpaths API #43 ，可以从source vertex出发，以某种label和某种方向的边（可选）出发，返回到所有叶子节点和包含环路的路径（由顶点id组成），如果满足你的场景的话，可以用这个。
3. zhoney commented on Sep 10, 2018

   

   zhoney

   on Sep 10, 2018

   Contributor

   More actions

   sugbraphpaths API拆分成了rays和rings API：
   rings：从一个vertex出发按照指定的方向和边label可达的所有环路的路径
   rays：从一个vertex出发按照指定的方向和边label到边界点（无法继续，相当于叶子节点）的路径
4. zhoney

   closed this as completedon Sep 10, 2018
5. fisherinbox commented on Oct 31, 2018

   

   fisherinbox

   on Oct 31, 2018

   More actions

   @zhoney 这个sugbraphpaths API具体怎么用,文档中没看到呢
6. Linary

   added a commit that references this issue on Nov 7, 2018

   add rays and rings restful api

   ...

   This issue will close once commit 82b361c is merged into the 'master' branch.

   82b361c
7. javeme

   added a commit that references this issue on Nov 8, 2018

   add rays and rings restful api

   ...

   This issue will close once commit 397c566 is merged into the 'master' branch.

   397c566
8. imbajin

   added a commit that references this issue on Oct 19, 2022

   fix DegreeCentrality degree count limit OOL (#39)

   ...

   199fb16
9. imbajin

   added 3 commits that reference this issue on Nov 2, 2022

   fix DegreeCentrality degree count limit OOL (#39)

   ...

   77c1921

   fix DegreeCentrality degree count limit OOL (#39)

   ...

   4cd6eb3

   fix DegreeCentrality degree count limit OOL (#39)

   ...

   37bd251
10. VGalaxies

    added a commit that references this issue on Aug 3, 2024

    Support RowLock in LockGroup (#39)

    ...

    49bff5e