Hi,
Thanks for the answere, i worked with selects, but comparing with the functions findObject and then neighbours it's quite slow. A graph data base isn't prepared to manage querys like selects, and i think that what it does is just list all the nodes and go one by one searching the coincidence of the attribute, that's why it takes so long to make and select compared to a neighbours for example.
But if there is nothing else i guess i have no choice, or maybe i have selected incorrectly the techonogy.
Marc
El divendres, 23 març de 2018 15:18:49 UTC+1,
c3po.ac va escriure: