On Sat, Jul 9, 2011 at 6:44 AM, Jim Webber j...@neotechnology.com wrote:
Hello Aliabbas,
It's domain specific, but in general you write less in a graph db because the
power is in relationships.
Imagine something akin to Digg where lots of users follow the postings of
other users. Each
Thanks but can we get the code of evaluation results of neo4j write
performance on large graph dbs having densely populated nodes
are there any published research papers which use them?
On 7/9/11, Jim Webber j...@neotechnology.com wrote:
Hello Aliabbas,
It's domain specific, but in general you
Hello Aliabbas,
Thanks but can we get the code of evaluation results of neo4j write
performance on large graph dbs having densely populated nodes
are there any published research papers which use them?
I don't know of any peer-reviewed research in this area.
Jim
Hello Aliabbas,
It's domain specific, but in general you write less in a graph db because the
power is in relationships.
Imagine something akin to Digg where lots of users follow the postings of other
users. Each time a writer posts something new, all of the followers will
typically need to
Hi there,
Just answered in a discussion tangentially mentioning this at Quora,
http://www.quora.com/Which-Relational-NoSQL-approach-will-you-recommend-for-storing-Trees-with-real-time-aggregation-from-child-nodes-to-Parent-nodes/answer/Peter-Neubauer
/peter
Sent from my phone.
On Jul 9, 2011
Hi to all,
I think the power of graph dbs in reading (and especially deep traversal)
operations - check
http://markorodriguez.com/2011/02/18/mysql-vs-neo4j-on-a-large-scale-graph-traversal/
BTW, if we could have the full code of this or some other benchmark
comparing neo4j with the respective in
I had read in this group that neo4j graph db writes are less as
compared to a relational db for the same load. Is there any
experimental evaluation or a research paper concerning this?
--
Aliabbas Petiwala
M.Tech CSE
___
Neo4j mailing list
7 matches
Mail list logo
