This question was answered in this thread on the neo4jrb mailing list:
http://groups.google.com/group/neo4jrb/browse_thread/thread/69315995dd28fa19
/anders
Sumanth Thikka wrote:
Hi,
I am newbie to neo4j and I am enjoying it.
I have started to create nodes, relationships and assigning
Even though the catch-clause throws an exception the finally-block
will be run as usual just as if there'd be no catch-clause at all.
What your code is missing is a tx.success() after doSomething(). Also
this code doesn't need the tx.failure() call (since throwing the
exception will make the
Hi,
Yes we are working on monitoring tools. Since transactions are held in
memory until committed larger transactions (containing many write
operations) will consume more memory. It would be possible to not keep
the full transaction in memory but that would kill read performance in
that
Hi,
You can not make such an ordered search using the Lucene indexing
service. You could try to only use a traverser instead of a Lucene
search and let the traverser do the filtering.
I am not sure I understand your problem completely. If you could
describe the problem in more detail I am sure
Hi,
firstly I used the numbers of 9 bytes * number_of_nodes and 33 bytes *
number_of_relations for the neo.props configure, but it doesn't work.
After that I tried with my actual configuration:
neostore.nodestore.db.mapped_memory=180G
neostore.relationshipstore.db.mapped_memory=6000G
Around 57.000.000 nodes and 322.000.000 relationships. Now I'm trying
with the following configuration:
neostore.nodestore.db.mapped_memory=913M
neostore.relationshipstore.db.mapped_memory=11G
neostore.propertystore.db.mapped_memory=50M
neostore.propertystore.db.strings.mapped_memory=100M
2010/2/24 Sumanth Thikka suma...@truesparrow.com:
Hi Mario,
Thanks for your reply.
My requirement is to avoid duplicates. For that, do we need to find the
nodes with the same value and avoid inserting, as it is mentioned or any
alternative(optimized) ways known to do this?
The best way is
Hey Miguel,
What is the configuration of your machine, besides de amount of RAM you
reported?
Also, could you post the time to complete the walk?
-Regards
Gutemberg
___
Neo mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
I guess the bigger question to me is why 57 million relationships would require
13 GB for the propertystore file and 67 GB for the string propertystore.
Something doesn't seem right. Can you describe what types of properties you're
storing on each node/relationship?
Rick
-Original
2010/2/24 Rick Bullotta rick.bullo...@burningskysoftware.com:
Doh! I told you I wasn't sleeping enough...
Thanks. Total brain fart on my end regarding the finally clause always
being executed (how long have I been coding in Java?)
Haha, yeah... well we all forget stuff sometimes :)
Just to
Hi John,
Thanks for the reply. Consider a scenario like LinkedIn:
1) I wanna search for all profiles in linkedin matching Neo4J
2) Now i get, lets say 20 people having Neo4J on their profiles. So far so
good. But i wanna order these search results based on my order. Like first i
wanna search
If your resultset returns too many records is going to be slow sorting
after retrieving the results.
If you results have to be paginated in most cases you have to sort
over the full resultset.
Also if you plan to get things ordered by multiple properties you need
some kind of btree structure.
This
Hi Satish,
Can you assign the keyword that you intend to search as the property
of the node? For example, assign 'neo4j' as a property of the node. Of
course, it won't be possible if it's a free form search that you
intend to do. But if you can, than traversing and sorting would be so
much
13 matches
Mail list logo
