Mmh,
I was thinking on how to return the contents of the output stream, I
am not quite sure how to return that. What woudl be a good format for
you?
Also could you reduce this into a small testcase that I can work on?
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype
Hi,
Peter brings up a good point. Its hard for us to parse complex queries and see
where Exceptions are happening. If you can isolate the problem via a simpler
traversal, that would be best for us -- and our little baby brains.
Also, note the following syntax optimizations for your traversal:
Hi folks,
thought this might be interesting for some of you ...
http://www.dzone.com/links/r/why_im_pretty_excited_about_using_neo4j_for_a_cmd.html
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn
Hi Peter,
seems like you confused CMDB (Configuration Management Database) with
CMS (Content Management System)? While Neo4j is perfect for building
both, the use cases don't have very much in common ...
Greetings
Axel
Am 07.12.2011 09:26, schrieb Peter Neubauer:
Hi folks,
thought this
Is Neo4J a good fit for performing analysis on event data? For example if you
were recording how long events took and wanted to get percentile data for a
particular customer and product.
Would this me mapped something like:
Node: Duration
Properties: duration (eg number of seconds/milli),
Haha,
sorry, my bad. I meant CMDB actually :) Thanks for pointing that out Axel!
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter http://twitter.com/peterneubauer
brew install
Of course the graph can be used for processing event data, and whether
that works for your case or not depends. But we have used it for this,
and I can discuss a few points.
The event stream is obviously just a linear chain and can be modeled
as such in the graph (eg. with NEXT relationships
We do indeed have twice the node count (and twice the relationship
count). This is a necessary side effect of the fact that an OSM node
can participate in more than one way (at intersections as well as
shared edges of polygons, etc.). In addition, with shared edges the
direction can be reversed
Qualifying the relationships with an additional property (or properties)
sounds like a sensible approach.
The simplest thing to do would be to have a boolean property to distinguish
the two types, so they would both have relationship type KNOWS, and also
a boolean property well. You could use
To Niels' approach,
Wouldn't it be a very dense graph ? For e.g. there will be several people
inter-connected by KNOWS; if we model KNOWS as a node, there would be lots
of edges originating from it.
On Wed, Dec 7, 2011 at 5:16 PM, Alistair Jones
alistair.jo...@neotechnology.com wrote:
FWIW, we use Neo4J also as our dependency graph in ThingWorx. We can
determine deep, two-way dependencies quite easily, so that when any object in
ThingWorx is modified, we can intelligently do hot updates to affected
entities without having to stop and restart the entire server. It would
A subset of the graphs are trees, and they have a few problems that are
specific for them. I'm right now planning what needs to be added to Cypher
to make it play nice with your tree structures.
I'd love to know if you have hierarchical data, and what queries you do and
would like to do. Doesn't
I think my explanation was not clear as it should be.
I wasn't suggesting to replace the relationships with a node, but to shadow the
relationshiptypes with a node.
Let's say we have two relationshiptypes, KNOWS and FRIEND, where we want to
state that friends form a subset of the people a
I definitely second this suggestion. We have recently being working on a
binary store for dense data we would like to access as if they were
properties of nodes. Right now we have properties that are references to
files on disk, and then handle the binary ourselves, but this does not
benefit from
Mmh,
I would like to see that I can specify the stem of the tree as a
path and then get leaf nodes out from that, something like
START root = node(0)
MATCH stem=root-(dir?*), stem-[:LEAF]-leaf
WHERE all(x in nodes(stem)
WHERE x.importance 30)
RETURN leaf, stem
Does that make sense?
Cheers,
I would love to see consideration of branch ordering.
Predicate support for trees like we now have for paths.
And returning trees and subgraphs as cypher results.
Can we generalize this discussion to connected subgraphs or is this too early ?
Michael
Am 07.12.2011 um 16:14 schrieb Peter
http://docs.neo4j.org/chunked/milestone/rest-api-service-root.html
The Reference Node:
{
relationship_index : http://localhost:7474/db/data/index/relationship;,
node : http://localhost:7474/db/data/node;,
relationship_types : http://localhost:7474/db/data/relationship/types;,
Ahh yes,
Good call!
/peter
Sent from my phone, please excuse typos and autocorrection.
On Dec 7, 2011 4:40 PM, maxdemarzi maxdema...@gmail.com wrote:
http://docs.neo4j.org/chunked/milestone/rest-api-service-root.html
The Reference Node:
{
relationship_index :
+1 as this also goes into the direction of nested sets
Am 07.12.2011 16:14, schrieb Peter Neubauer:
Mmh,
I would like to see that I can specify the stem of the tree as a
path and then get leaf nodes out from that, something like
START root = node(0)
MATCH stem=root-(dir?*),
On Wed, Dec 7, 2011 at 4:47 PM, D. Frej dieter_f...@gmx.net wrote:
+1 as this also goes into the direction of nested sets
I don't get it. Maybe I have my nomenclature all wrong, but
thishttp://en.wikipedia.org/wiki/Nested_set_modelis what I think of
when I hear nested sets. What am I missing?
On Wed, Dec 7, 2011 at 4:14 PM, Peter Neubauer
peter.neuba...@neotechnology.com wrote:
Mmh,
I would like to see that I can specify the stem of the tree as a
path and then get leaf nodes out from that
Yeah, the cook book exposed this weakness clearly...
, something like
START root =
On Wed, Dec 7, 2011 at 4:25 PM, Michael Hunger
michael.hun...@neotechnology.com wrote:
I would love to see consideration of branch ordering.
What do you mean? An example would be helpful.
Predicate support for trees like we now have for paths.
Didn't think in these terms. I like it. Do
ok, I agree I was too short on this one.
What Peter suggested was to start somewhere in a tree (stem) and get the
leafs based on a condition (x.importance 30). For me, this is similiar
to hierarchies, which are often build with the help nested sets in RDBMS.
Anyways: forget about my comment.
E.g. a timeline tree with root - centuries - years - months - days - hours
I want to traverse the tree with cypher in the order of the entries, e.g. to
extract data in a ordered fashion.
Am 07.12.2011 um 17:05 schrieb Andres Taylor:
On Wed, Dec 7, 2011 at 4:25 PM, Michael Hunger
Hi all,
it turns out the Google Apps for you Domain Groups are not showing up
in the central Google Index. That means we will switch this weekend to
https://groups.google.com/forum/#!forum/neo4j instead.
Currently, every mail to this list is forwarded to the new Google
Group, and this will stay
I'm trying to create a cypher query.
I have a shop=node(123) and me=node(321) start nodes.
I want all items that shop-[:sell]-item-[:like]-user but does not exist
any r1 me-[r1:like]-item.
It's that possible with cypher?
--
View this message in context:
Hey André,
you already almost did it, just copying your parts together
start shop=node(123), me=node(321)
match shop-[:sell]-item-[:like]-user,item-[r1?:like]-me
where r1 is null
return item
the missing part was the optional relationship for r1, which allows it to be
null and you check for
Hi,
Thanks for the tips, will see if I can change the client to use the new format.
Indeed, let me try isolate the problems with more simpler queries. I have built
a test case below, forgive me if I made it to complex.
Friend = HasPet = Pet = HasCareTaker = CareTaker
Friend = HasPet = Pet =
Finally thanks to Peter and Marko, the .Net Neo4jClient code has been optimised
to use short hand version of in('') and out('').
ChangeSet is http://hg.readify.net/neo4jclient/changeset/91ef447a9053
___
NOTICE: THIS MAILING LIST IS BEING SWITCHED TO
29 matches
Mail list logo
