Hi,
Each of my nodes has a 'time' property associated with it. Is there any way I
can retrieve all nodes where 'time' is greater than a specific value? I can't
see how to do this with a full-text index...
Thanks,
Tim
___
Neo4j mailing list
Hi Tim,
Isn't the Timeline-index available in your neo4j-version?
It appears to give you just what you want:
http://api.neo4j.org/1.0/org/neo4j/index/timeline/TimelineIndex.html
Best regards,
Arjen
On 22-7-2010 11:23 Tim Jones wrote:
Hi,
Each of my nodes has a 'time' property associated
Brilliant, thanks a lot Arjen, I hadn't seen that.
- Original Message
From: Arjen van der Meijden acmmail...@tweakers.net
To: user@lists.neo4j.org
Sent: Thu, July 22, 2010 10:55:59 AM
Subject: Re: [Neo4j] Retrieving nodes by a time property (e.g. time now-20
minutes)?
Hi Tim,
Hi to all
Find out interesting thing in BatchGraphDatabaseImpl. I tried to load a
lot of data using BatchInserter Service and everything was OK. But some
nodes that were created in the end didn't have any properties. So I
looked to the code and find next here:
Properties writes to database
Dear David,
This issue make me crazy! help me please.
I've created a new database with the following features:
NeoStore:
* neostore.nodestore.db = 30M
* neostore.propertystore.db = 258M
* neostore.propertystore.db.strings = 916M
* neostore.relationshipstore.db =
Hi All
I'm trying to label all connected components in a graph - i.e. all
nodes that are connected will have a common componentID property
set. I'm using the Traverser to do this. For each node in the graph
(unless it is already labelled, which I track by inserting the node ID
in a list), the
The first obvious thing is that labelled.contains(currentNode.getId()) is
going to take more time as your dataset grows, since it's a linear search
for the element in an ArrayList. A HashSet would be a much more appropriate
data structure for your application.
The other thing that comes to mind
thanks Tobias, it is working now, have been learning a lot abt jython and
geo-neo4j lately :)
best,
sima
--- On Wed, 21/7/10, Tobias Ivarsson [via Neo4J User List]
ml-node+983357-111945109-341...@n3.nabble.com wrote:
From: Tobias Ivarsson [via Neo4J User List]
Hi,
Thanks for reporting this. The elementCleaned() must be called for
each element in the cache on shutdown so this is a bug.
Regarding performance the batch inserter implementation is there for
convince and will not perform as good as the normal batch inserter
API. There may be a full
And in the meantime I'm rewriting some code to use the batch inserter, but
the LuceneIndexBatchInserterImpl is not reading an index that already exists
in the db! (I'm trying to use a pre-existing index to find parent nodes for
the nodes I'm inserting.) The shell verifies the index is in fact
I believe the issue is the size of the transaction, based on a similar
question. Can you batch the inserts into transactions with about 30k per
transaction?
--
Toby Matejovsky
On Thu, Jul 22, 2010 at 11:27 AM, Jeff Klann jkl...@iupui.edu wrote:
I'm stumped on this one.
I'm getting the fast
Martin,
On Tue, Jul 20, 2010 at 2:23 PM, Martin Skurla buja...@gmail.com wrote:
about surf nodes = sorry I don't get the point. Surf nodes are all
nodes except leafs?
Well, I was thinking in terms of defining a filter or a depth to surf
(e.g. depth 1) and then I would be able to click on a node
Kei,
we are extremely interested in Neo4j support for Cytoscape, as we are
seing a lot of interest for Graphs from the Computational Genomics and
Bioinformatics crowd, but in practice, a lot of work is done in iGraph
and R, and limited to very basic analytics and the built in graph
algos. I think
Yes, thanks that fixed it. I noticed this is documented at
http://wiki.neo4j.org/content/Transactions under Big Transactions. Perhaps
there should be a link here from the performance guide.
Thanks,
Jeff Klann
On Thu, Jul 22, 2010 at 3:30 PM, Toby Matejovsky
toby.matejov...@gmail.comwrote:
I
Jeff,
added a link in the Wiki,
http://wiki.neo4j.org/content/Neo4j_Performance_Guide#Write_performance
. Any other place you think would be good to have this info in?
Cheers,
/peter neubauer
COO and Sales, Neo Technology
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46
Hi,
I am experimenting with noe4j for some classicla graph algorithms such
as shortest path and centrality.
The component page for graph-alo-0.6 does mention that centrality
algorithms cannot scale to very large graphs. Judging from what is
being discussed in this list, a 78K node(and about 75K
Corrected some numbers...
On Thu, Jul 22, 2010 at 5:11 PM, Rushan rushan.c...@gmail.com wrote:
Hi,
I am experimenting with noe4j for some classicla graph algorithms such
as shortest path and centrality.
The component page for graph-alo-0.6 does mention that centrality
algorithms cannot
Thanx to both of you. Yes, I can just check whether the label exists
on the node or not. In my case checking for Integer.MIN_VALUE which is
what is assigned when the subscriber node is created.
BTW - is it ever possible to label the components while creating the
graph? I can't think of any way of
18 matches
Mail list logo
