Yep, definitely. You'd batch your transaction to sizes like 1k elements at a time.
Usually it's more (20k-50k) but there is an issue in 2.0 that does makes findNodesByLabelAndProperty slower when working in larger transactions :( On Mon, Jan 27, 2014 at 2:27 AM, Javad Karabi <karabija...@gmail.com> wrote: > i should clarify that the arguement to firstOrNull is > findNodesByLabelAndProperty, so i am assuming that most of the time is > actually in that function, that findNodesByLabelAndProperty may be whats > taking longer as the transaction grows > > > On Sunday, January 26, 2014 7:10:55 PM UTC-6, Javad Karabi wrote: >> >> im importing data from a csv file, and when i wrap the whole thing in one >> transaction, the performance is actually slower than multiple transactions. >> when i use one transaction, most of the time is spent in the closing of >> the transaction, but when i wrap the whole thing in one transaction, most >> of the time is spent in IteratorUtil.firstOrNull, (although, again, using >> multiple transactions is faster) >> >> does the performance of firstOrNull degrade as the transaction it is in >> gets larger? >> > -- > 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 neo4j+unsubscr...@googlegroups.com. > For more options, visit https://groups.google.com/groups/opt_out. > -- 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 neo4j+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
