Yup,
that is our assessment, too. On 1-3 joins there is a chance to
optimize the queries in an RDBMS. But still you have indexes instead
of references, and the overhead of serialization through the JDBC
driver. Anyway, it even shows that Java based DBs are not necessarily
slower than C based.
On Tue, Mar 30, 2010 at 8:57 AM, Peter Neubauer
neubauer.pe...@gmail.com wrote:
MySQL degrades as the data volume increases, and as the depth
increases (at depth 5 MySQL just hangs).
You used MyIsam ? InnoDB ?
What about postgresql ? (which is not supposed to be faster than
MyIsam, but usually
Would making the underlying Node publically available (via a getter) be
virtually the same thing? In that case the meta model classes could have
such a getter.
2010/3/26 Niels Hoogeveen pd_aficion...@hotmail.com
Hi Peter,
I added a Wiki entry in my github repo called Reification of meta
Not sure about the MySQL flavor,
Marko has been doing the tests on his machine ...
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
MetaModelObject already has a getter (without using the word get) to access
the node.
Wrapping MetaModelObject to give it a Node-interface makes it possible to
directly write:
metalObject.setProperty(a, b)
instead of
metaobject.node.setPropert(a, b)
If that were all, I wouldn't make a
Or sql server or oracle (gasp), which are much faster than mysql in many use
cases...
The problem with any type of benchmark is that they tend to be very situational.
But it is still valuable information, as long as it is viewed in context and
not as an absolute.
--Original
Hi,
You used MyIsam ? InnoDB ?
What about postgresql ? (which is not supposed to be faster than
MyIsam, but usually faster than InnoDB)
I used MyISAM.
Marko.
http://markorodriguez.com
___
Neo mailing list
User@lists.neo4j.org
Hi,
Can the property values specified in relationships be custom objects?
E.g.
class Dummy: pass
db = neo4j.GraphDatabase(test)
with db.transaction:
foo = db.node()
bar = db.node()
typ = Dummy()
foo.RELATION(bar, rel = typ)
I get the following error for the above:
RuntimeError: No matching
We had a little discussion about how to make a first/good implementation of
traversers in the Neo4j REST API. If we just start at the core and expose
basic traversers, as they are in the graph database API (or will be, with
the next iteration of the traversal framework finding its way into the
Hi Bujji,
We are working on a sort of master-slave replication. In our implementation
it is possible to write to any instance, but the master is responsible for
coordinating lock management, and manage the distribution of changes. This
system also has master fault tolerance, where a new master is
XPath is probably not expressive enough for all use cases, but it's a nice
way to express things for the cases where it does work.
As we said, this was only one suggestion for how to do traversals in the
REST framework, our main suggestion was sent out a few minutes ago:
Hi guys,
For what its worth
I have yet to use the Neo4j traversal framework because it is simply is not
expressive enough. The traverser framework is like a single-relational
traverser on a multi-relational graph. You only allow or disallow certain edge
labels--not the ordered
On Tue, Mar 30, 2010 at 4:20 PM, Marko Rodriguez okramma...@gmail.comwrote:
Hi guys,
For what its worth
I have yet to use the Neo4j traversal framework because it is simply is not
expressive enough. The traverser framework is like a single-relational
traverser on a multi-relational
Hi Jody,
Welcome Leandro - I had the pleasure of seeing i3geo when I was in Brazil
last year for a conference; impressive stuff!
I was thinking develop a uDig mapfile export (mapserver) at the Summer of
Code. It'll very useful for i3geo.
___
Neo
Hi Leandro,
awesome, we would love to get you onto the Neo4j-GeoTools-uDig
integration project, please contact Craig (Mentor) and me for further
working out the details - exciting times!
Cheers,
/peter neubauer
COO and Sales, Neo Technology
GTalk: neubauer.peter
Skype peter.neubauer
http://highscalability.com/blog/2010/3/30/running-large-graph-algorithms-evaluation-of-current-state-o.html
--
Laurent ker2x Laborde
Sysadmin DBA at http://www.over-blog.com/
___
Neo mailing list
User@lists.neo4j.org
Hi,
Craig (and others): I thought you might have fun looking at all the interesting
indices w/ accompanying Java applet.
http://donar.umiacs.umd.edu/quadtree/index.html
Endogenous indices and graph databases...
Take care,
Marko.
http://markorodriguez.com
Hi Leandro,
Thanks for showing an interest in the Neo4j-uDIG project. Your work on the
distributed rtree sounds very interesting and very appropriate to the
project we have in mind. I would love to discuss this with you and introduce
you to some of the ideas we are working on. I will contact you
Very cool, and great illustration of the algos in the applets! Will
add a link there on the Wiki ...
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
Mattias Persson schrieb am 30.03.2010 um 15:02:19 (+0200):
We're discussing how to expose traversers in the REST API. One of the
ideas that was brought up (more emails with the rest of the ideas are
coming) was to use xpath directly in the URIs.
I have some experience working with XSLT and
Mattias Persson schrieb am 30.03.2010 um 16:06:49 (+0200):
a JSON document describing the traverser, like:
{ order: depth first,
uniquness: node,
return evaluator:
{ language: javascript,
body: function shouldReturn( pos ) {...} },
prune evaluator:
{
Hi Marko,
Marko Rodriguez schrieb am 30.03.2010 um 12:50:21 (-0600):
Also, XPath being for trees, do you constrain the graph to tree
form?
XPath easily generalizes to work for graphs. See
http://gremlin.tinkerpop.com and more specifically,
Hi,
I just want to sure about transactions.
Before the transaction's success (commit), I have a loop that first check the
relations of each node and then add new relations for each node of the graph.
Is it possible that when checking the existence of a relation, it's not shown
because its
Changes made in a transaction are always visible to the executing thread
even if those changes haven't been successfully committed yet. They are,
however, not visible to other threads until the transaction is successfully
committed. See more information about transactions at
Hi Marko,
Marko Rodriguez schrieb am 30.03.2010 um 14:42:44 (-0600):
When doing //, it remembers previously seen elements and then halts
that particular path when that element has been seen again. However,
there are many many many paths in any complex enough graph (so usually
this is just a
Hi Marko,
Marko Rodriguez schrieb am 30.03.2010 um 16:01:42 (-0600):
Ha. There is a Gremlin mailing list if you are **super** interested
:). http://groups.google.com/group/gremlin-users ... However, don't
even try and join unless you are SUPER interested. :P
Thanks - too late, I
Hey,
outE/outV # confusing way of saying (in XPath) self::node()
inE/inV # ditto
.I supposebut once you get to an edge, you need to specify where you want
to go next (the tail or the head of the edge).. ? The outE/V convention would
mean you have to know that you did outE the prior
How can I find JavaDoc for BatchInserter?!
It's not available in the doc folder of apoc or kernel component.
___
Neo mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
28 matches
Mail list logo
