Could you copy-paste the exact command line to start java? I'd like to
see if there's some tyop with the heap size option.
2010/6/18 Peter Neubauer peter.neuba...@neotechnology.com:
Suruchi,
this sounds much to slow. Is there any chance of you sending over the
insert and query code and some
Hi!
If you want to be able to do read operations without the need for a
transactional context you could try using the latest development snapshot.
Development snapshot download links has been added here:
http://neo4j.org/
/anders
Cheers,
Tobias
On Mon, Jun 21, 2010 at 2:12 AM, go
Hello guys, hello community!
I'm currently evaluating neo4j for my thesis and have a wish :)
I have already opened a ticket for this,(
https://trac.neo4j.org/ticket/241 ) but
I would like to hear what you guys think about it.
Basically it just involves the ability to index Neo4j Relationships
+1 for OSM import into Neo4j Spatial
(in fact +1 for any import source that uses some kind of temporary foreign
key, eg. relational table dumps, xml structures, etc. - lucene is useful for
indexing the external foreign key during import, and then dropping it
entirely afterwards)
On Mon, Jun 21,
A side comment, since I think indexing relationships with lucene might be
good, but think there might be alternatives for your current example.
You said that the relationship property is a float from 0 to 1, so you
cannot use relationship types, but actually, when you consider that any
index is
Hi,
how do you guys expect indexing for relationships to work? Would it be
an index just as for nodes... or per node? I often hear that it'd
speed up traversals if a node has many, many neighbours. But if the
relationship index would be for the entire graph (not per node) that
wouldn't really
Hey Guys,
need a bit more help with this one
I'm trying implement the bus timetable into the graph and also allow for
walking distances between stops to be calculated
Every journey for each route is stored with time data, the cost between each
node is the travel time in minutes between the
I am not sure was a per-node relationship index is. I concur that a
relationship index doesn't help if each node has a relationship of the type we
are interested in (like in a graph of employees, each employee would have a
Manager relation). However, in a graph where there are lots of nodes
I think the combination of relationship type + relevant property value(s) is
a more appropriate context for an index, as opposed to for all
relationships in the graph.
FWIW, we achieve this today with Neo directly using the concept of bucket
nodes. Instead of having to create different
You got me again, Rick.
I have not (yet) used my idea of ranged relationship types, and still use
buckets, or intermediate nodes (all over the place!). However, I am
thinking of using a combination of the two approaches for my composite
index. I have deviated from the classic binary tree because
Hi,
thanks a lot for the feedback.
There are a lot of applications where indexed relationships will provide a
speed benefit, but just to a limit. This advantage of sparse properties on a
lot of edges ( I.e. 100 relationships with a property - as opposed to 1000
relationships without ) holds its
Hello,
Sorry, this maybe asked before - I saw byte [] is supported as property type. I
assume I can use that to store binary data, like attachments.
Is there any storage limit to it ? Will indexing/searching performance be
affected ?
Thanks,
canal
thanks,
canal
12 matches
Mail list logo
