Hi Alx,
Most probably because your data/graph simply not fullful your total cypher
statement, Remeber that your are matchning a pattern and you start with
limiting it to users that has a uid property. For example the graph data
below returns a resultset for each individually MATCH queries, howe
I have the following cypher query:
MATCH (n:User) WHERE HAS(n.uid) MATCH
(n)-[:LOCATED_IN]->()<-[:LOCATED_IN]-(m), (n)-[:TEXTED]-(k) WITH COLLECT
(DISTINCT m.name) AS users1, COLLECT( DISTINCT k.name )
AS users2 RETURN users1+ users2
But it returns me no result. It just returns a title "us
Thank you Lundin for your help. I just posted on that thread. In the
meantime, I've restored my recent backup so it's less of a headache! I'll
stay away from Gephi for now.
Best, JB
On Sat, Apr 19, 2014 at 2:49 PM, Lundin wrote:
> No I am sorry i am not familiar with the plugin or what it does
No I am sorry i am not familiar with the plugin or what it does the store
with various Neo4j versions. Seems to exists github issues ongoing
https://github.com/gephi/gephi-plugins/issues/40
Something happend indeed.
Den lördagen den 19:e april 2014 kl. 20:21:15 UTC+2 skrev Jean-Baptiste
Gllpn:
Hello,
thanks for your response.
I created the database in the Neo4j instance I'm running, and I only have
one version.
I suspect the problem may come from the fact that yesterday I attempted to
load my database into Gephi using the Gephi plugin. Gephi failed to import
the database, so I uncomme
Hi,
This store/graph.db is from the same Neo4j version ?
Mismatching store version found (v0.A.2 while expecting v0.A.1).
Seems to indicate that your current store was created in a newer 2.0.2
version while you are running .0.1, do you have multiple version ? Try with
0.2 version.
Den lördage
Hello,
I was using Neo4j without a problem but my server is now failing to start.
The error log is a bit cryptic to me. Any idea as to how I could fix this?
Many thanks in advance for your help.
Jean-Baptiste.
avr. 19, 2014 1:03:30 PM org.neo4j.server.logging.Logger log
Infos: Setting startup
Great to hear that it works Tom, looks good! Have you put index in place
and are you doing parametered queries in order for better performance as
well ? (or mabey it works good "as is" ?). For the typecasting, well
yes..but i guess some kind of type assertion needs to be in place on the
server
Hi Benny,
In your examples, which seems to have an very finite numbers of
relationships types, i would go for adding relationship vs properties. Thus
the traversal can be done cheap rather than involve properties that would
be needed in the look-up. This is the best design performance wise. But
I echo this:
Hannah's visits are a linked list of things she's done. Each visit is -[:TO]->
a place. To find Hannah's visit history just means traversing the list.
Jim
On 26 Sep 2013, at 12:08, Michael Hunger
wrote:
> I meant relationships between the visit event nodes to indicate the order.
We didn't bother taking locks on the database since we knew that the user
load wasn't going to be much. Last I've heard, the website was a failure
with just approximately eighty thousand users. But the reasons for failure
was the business model and not the technology.
It was more or less a first p
Hi Lundin,
Thanks a lot for your replies and efforts to find a workaround. I finally
decided to use the explicit typecasting, and build the rest of the cypher
statement which now looks as this:
MATCH (p:project {name:
"ProjA"})-[:CURRENT|PREV*]->(pv:projversion)-[pu:ADD|REMOVE]->(pt:projtransi
I suppose I would like to know:
Was it efficient?
How many users did you end up getting using your social network?
I have played with linked lists in neo4j (there are a few questions I have
asked on this list if you are interested) In order to get parallel
insertion when more than one user commen
Hi Aran
On one of my projects we designed a simple social network using Neo4J.
The user posts used to be linked to whichever user has first posted.
Comments on the post were a linked list. When a user went to his wall, we
used to simply pull posts from all his friends and the comments on those
po
I have been messing around with social network design. One of the things
that I have taken a long time getting right is linked list insertion. For
any feed based social network the feed query is the most important query in
the system. This query will be executed the most and needs to be
performant.
15 matches
Mail list logo
