In a batch insertion using indexes, given a huge set of nodes and relations such that the node and relationship store cannot fit in mapped memory, how should one divide memory between MMIO and index caches to achieve optimal performance? I am already somewhat familiar with how to divide memory within the mapped-memory schema. I am mainly interested in the overall allotment of memory between MMIO and the caches. I think a general answer to this would be useful to the community at large, but here are some specifics about my case:
- N nodes - 2*N relationships - Only about 30% of nodes are cached because the rest are never read. - Relationships are not cached because they are never read. -- 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/groups/opt_out.
