The union find algorithm would be appropriate for labeling connected
components as you build the graph.
Andrew Baine
On Thursday, July 22, 2010, Arijit Mukherjee ariji...@gmail.com wrote:
Thanx to both of you. Yes, I can just check whether the label exists
on the node or not. In my case
Hi!
We're switching the m2.neo4j.org Maven2 repository to a new server right
now. Please report any issues you encounter!
/anders
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
Great. Since you summarize the problem on that page and only mention small
transactions, I'd think you might want to mention my problem too... that
making a transaction *too large* also demolishes performance, because the
transaction's on the heap.
- Jeff Klann
On Thu, Jul 22, 2010 at 5:19 PM,
Ahh,
thanks for the hint, updated :)
Cheers,
/peter neubauer
COO and Sales, Neo Technology
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter http://twitter.com/peterneubauer
http://www.neo4j.org
All,
We are considering leveraging the concept of subgraphs as an approach for
interactively visualizing large quantities of data. The idea is that by
aggregating collections of nodes that share some characteristic into a single
node, we may be able to reduce a graph's complexity to the point
Hi Paul
My questions for the group are:
1) Are there any suggestions for how subgraphs might be algorithmically
determined? Are there clustering algorithms that might be leveraged?
What you describe brings to my mind the field of community detection
techniques, i.e. methods that
Ids (type long) are generated internally and cannot be supplied from
outside. However, you can use another arbitrary property key to represent
such a user-defined ID... For easy lookup also index that property for each
created node and query the index to get the node for a specific ID.
2010/7/22
2010/7/23 Tim Jones bogol...@ymail.com
Hi,
I need to be able to retrieve nodes whose timestamps are greater than a
particular time.
I've been trying to use a TimelineIndex, but didn't realise that it was a
persistent structure - I've written code that will create a new Timeline
each
time
Hi,
I need to be able to retrieve nodes whose timestamps are greater than a
particular time.
I've been trying to use a TimelineIndex, but didn't realise that it was a
persistent structure - I've written code that will create a new Timeline
each
time my application is
I'm not worried that nodes will become related, I just wanted to make sure
that
because they aren't already related that this wasn't going to cause a
problem
before I implement the Timeline - I've already spent longer than I'd
intended on
this and don't want to reimplement it if it's not
Hi,
I have updated the wiki with screen shots and information
http://wiki.github.com/paddydub/TransportDublin/
and I have uploaded my code and bus stop data sql script.
Any suggestions or recommendations would be appreciated. I'm currently
populating my graph from a mysql database,
I'm working
Yes, it seems that Neo4j has to be warmed up like my car! ;)
After warm-up, its performance is great.
Thank you so much
From: Mattias Persson matt...@neotechnology.com
To: Neo4j user discussions user@lists.neo4j.org
Sent: Sat, July 24, 2010 1:12:50 AM
Subject:
12 matches
Mail list logo