A -> B -> C 已知A, C能找查出B
A -> E -> D 已知A, D能找查出E
已知A 和 C,D是二度关系的情况下,查出B和E也好查,但是怎么知道 B->C,E->D的关系啊?
已知 33630944 的2度关注有10000005,10011385两个点,通过下面的语句能查出num==2的为他们中间的点,但是怎么知道中间的点与10000005,10011385这两个点的关系呢?
执行如下:
(user@nebula) [friend]> (go from 33630944 over follow YIELD follow._dst as uid union all go from 10000005,10011385 over follow REVERSELY YIELD distinct follow._dst as uid ) | group by $-.uid YIELD $-.uid as uid, count(*) as num | order by num desc | limit 5
==================
| uid | num |
==================
| 47633975 | 2 |
------------------
| 76764760 | 2 |
------------------
| 41149340 | 1 |
------------------
| 49846528 | 1 |
------------------
| 96605986 | 1 |
------------------
Got 5 rows (Time spent: 6.217/50.244 ms)
如果是单个点查询出来默认就知道关系了,主要是要批量查询 C,D的这些点,比如一页有30个,要请求30次效率就太低了