Re: [Neo4j] Does anyone know why Graph Database (Neo4j) consumes more memories(RAM) and has bigger file size(graph.db) than Relational's?

Thank you for the explaination Chris. On Monday, May 26, 2014 10:31:03 PM UTC+7, Chris Vest wrote: > > > On 26 May 2014, at 16:39, Rio Eduardo > > wrote: > > 1. For Memory => Is it because Neo4j stores data in RAM? or are there > other causes? > > > It caches both on the entity level, and also h

[Neo4j] Struggling with the Spring Neo4j Tutorial

Hi, I'm new to Neo4j (and Spring). I am following this spring data neo4j tutorial and am stuck on how to proceed. Since the EmbeddedGraphDatabase has been deprecated I decided to change the code to use the recommended GraphDatabaseService API.

[Neo4j] What's the biggest known deployment for Neo4j?

I'm curious about the largest known deployment and how their infrastructure looks. I would also be curious about whether or not they use the full text search. -- -Richard L. Burton III @rburton -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsub

Re: [Neo4j] Question about Relationships number and their influence on algorithms

Actually there is no direction both in neo4j's datastore, you can use BOTH when querying. On Mon, May 19, 2014 at 2:30 PM, Angelo Immediata wrote: > Hi Michael > > For hot dataset do you mean a dataset stored in memory? Well we tried both > for in memory dataset and for dataset on the disk > Wel

Re: [Neo4j] Question about Relationships number and their influence on algorithms

Hi, About the number of relationships per node and how that affects things: it affects the load performance of a node the first time its relationships are touched after the node being freshly loaded into memory (either first time, or after eviction from cache). Iterating over all of a certain type

[Neo4j] Dictionary analysis in Neo4J

Does anyone know a project that has used Neo4j to do a network analysis of an English dictionary? I'm interested in finding help with analyzing a dictionary. Thanks Bob Parks Enter code here... -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To uns

[Neo4j] Re: Neo4j A Star algorithm performance questions

Any idea about these low performances? Il giorno lunedì 19 maggio 2014 19:41:05 UTC+2, Angelo Immediata ha scritto: > > Hi there > > We are using Neo4j 2.0.3 in order to build a routing system. We are using > the classical A Start implementation, tough we saw that there is a > TraversalAstar imp

Re: [Neo4j] Does anyone know why Graph Database (Neo4j) consumes more memories(RAM) and has bigger file size(graph.db) than Relational's?

On 26 May 2014, at 16:39, Rio Eduardo wrote: > 1. For Memory => Is it because Neo4j stores data in RAM? or are there other > causes? It caches both on the entity level, and also has a page cache for memory mapped bits of the store files. Transaction states are currently also entirely in ram.

[Neo4j] Does anyone know why Graph Database (Neo4j) consumes more memories(RAM) and has bigger file size(graph.db) than Relational's?

1. For Memory => Is it because Neo4j stores data in RAM? or are there other causes? 2. For Disk => Is it because Neo4j store all of relationships? or are there other causes? Can anyone explain it and give me any references that can explain it why? Thank you. -- You received this message becau

[Neo4j] Retrieving Count(*) for Outgoing/Incoming Relationship Indivudally

I have a Object with following/follow relationship (see extract below). I'd like to retrieve the Count(*) for each of these relationship(incoming/outgoing) using Cypher Query. I tried the following but getting error near the word (DIRECTION). START user=node({0}) MATCH user-[:FOLLOWS]-() WHER

[Neo4j] Re: Another Native-Java-DSL for the Cypher Language

Hello everyone, Release 0.2.0 of the Java DSL for Cypher (JCypher) is available. Implementation of expressions and their mapping to Cypher is completed. Please have a look at: https://github.com/Wolfgang-Schuetzelhofer/jcypher/wiki

[Neo4j] Re: relations between group on nodes

is it maybe faster to do it with cipher? start n = node:idx("MyID:(1 2 3 1 1500)"), m = node:idx("MyID:(1 2 3 1 1500)") MATCH p=(n)-[r:RELATED_TO]-(m) RETURN p or 2 find the best between 2 pairs? thank you. On Monday, May 26, 2014 10:15:45 AM UTC+3, natali wrote: > > hey' > i h

Re: [Neo4j] relations between group on nodes

You iterate eith 2 for loops between those 100 nodes and find the paths between each pair Sent from mobile device Am 26.05.2014 um 09:15 schrieb natali : > hey' > i have a db with 300,000,000 relations and 20,000,000 nodes > and i have a group of 100 nodes that i wanna find the relation betwee

[Neo4j] Re: relations between group on nodes

Assuming that you can identify the 100 nodes // MATCH and/or filter the 100 nodes MATCH (n) WHERE // put the nodes in a collection WITH collect(n) AS mynodes // get als the relations withing the context of the collection MATCH (n)-[r]->(m) WHERE (n IN mynodes) AND (m IN mynodes) RETURN n,r,

[Neo4j] relations between group on nodes

hey' i have a db with 300,000,000 relations and 20,000,000 nodes and i have a group of 100 nodes that i wanna find the relation between this nodes and create from it a sub graph, how can i do it with java api? (find path only works between 2 nodes) thank you. -- You received this message becau