Ok. I will try this and the atomization of directories and see which one behaves better. They are storing some data on a per source file basis. The delay alternating between those will be the litmus test.
Thanks a lot! On Friday, March 28, 2014 4:55:11 PM UTC-6, José Cornado wrote: > > findNodesByLabelAndProperty searches a whole graph. At this point is not > important because mine is tiny. > > But as it grows this function becomes slower. I can pinpoint the root node > from which all the nodes that match the function's criteria. So the > question is: > > is there a way to feed findNodesByLabelAndProperty an starting node? > (cypher seems to be an overkill) > > a workaround would be to split the graph in different directories so > findNodesByLabelAndProperty doesn't wander around. But this has the cost > of diferent embedded instances. > > any suggestions? > > thanks a lot!! > -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
