Description
In the simulation's agents it is common to make match queries in order to find concepts already present in the graph. This is typically when wishing to insert a new relation between those concepts.
At present the results are simply retrieved into a list, but this will cease to be performant as we run the simulation a lot of iterations. Streaming back the concepts doesn't fully solve the issue alone, if we wish to relate them together both randomly and deterministically. For this the design isn't necessarily obvious.
Take as an example:
Query 1: Get all single men in a city
Query 2: Get all single women in a city
Then create 50 marriages between random pairs from the results of each query.
Description
In the simulation's agents it is common to make
matchqueries in order to find concepts already present in the graph. This is typically when wishing to insert a new relation between those concepts.At present the results are simply retrieved into a list, but this will cease to be performant as we run the simulation a lot of iterations. Streaming back the concepts doesn't fully solve the issue alone, if we wish to relate them together both randomly and deterministically. For this the design isn't necessarily obvious.
Take as an example:
Query 1: Get all single men in a city
Query 2: Get all single women in a city
Then create 50 marriages between random pairs from the results of each query.