Roi Lipman

perf-GraphBLAS 7.3

5

temporary branch testing the new GraphBLAS 7.3 version

run bulk insert on Redis main thread

4

As we're required to hold the GIL while we populate our graph, there's no need to offload this work to a dedicated thread. this PR should be accompanied by a...

support bidirectional path pattern in shortestPath

2

Support bi-directional path pattern in `shortestPath` ``` MATCH (b:Person {name:'Kevin Bacon'}), (t:Person {name:'Tom Cruise'}) RETURN shortestPath((t)-[*]-(b)) ``` TODOs: - [ ] add tests - [ ] address `TODO` (line 198...

single source shortest path, Bellman-Ford

3

`CALL algo.shortestPath(startNode, endNode, weightProperty, relationshipQuery, defaultValue)` There are a number of TODOs left: handle multiple edges between `a` and `b`. The Bellman-Ford implementation is a bit different than the one...

common-neighbors

1

Compute similarity between nodes, similarity(n1,n2) = # direct shared neighbours / out-degree(n1) + out-degree(n2) - intersection

use grb_extract for the first multiplication

2

From old conversations with Tim, I've been told that when performing A *B where each row of A has a single value, (A is being used to pick out rows...

Node hash join

2

https://neo4j.com/docs/cypher-manual/current/execution-plans/operators/#query-plan-node-hash-join