So is there a generic way of parallel threading for searches ? match (n:Entity)-[*4]-(p) where p.name contains "......." Takes a long time on my system and uses 1 thread....
If so, could this not be part of apoc or the like ? On Friday, 31 March 2017 15:56:07 UTC+1, Max De Marzi Jr. wrote: > > This POC hits a bunch of your points => > https://maxdemarzi.com/2017/01/06/multi-threading-a-traversal/ > > On Friday, March 31, 2017 at 3:58:26 AM UTC-5, [email protected] > wrote: >> >> So I would like to see a benchmark that majors on the 'deep search' >> performance of the various graph databases, which would draw upon: >> >> 1. Multi threading (for single searches mainly) but for other operations >> also - limited by the capability of the graph DB >> 2. In memory enhancements.- limited by the capability of the graph DB >> 3. The ability to pointer chase (for optimisation) - limited by the >> capability of the graph DB >> 4. The graph data should comprise complex relationships, not just >> straight forward hierarchies. >> 5. The benchmark should be scalable (including the ability to fully >> utilise very capable nodes). >> >> Wayne. >> >> On Thursday, 30 March 2017 21:49:27 UTC+1, Andrii Stesin wrote: >>> >>> http://orientdb.com/orientdb-vs-neo4j/ >>> >>> what are they speaking about, I wonder?! >>> >>> WBR, >>> Andrii >>> >> -- 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.
