Re: [Neo4j] Cypher Aggregation functions - specifically SUM()

Hi there, you could do this with either the Travesal framework in Java (http://docs.neo4j.org/chunked/snapshot/examples-uniqueness-of-paths-in-traversals.html for an example) or, probably in Groovy/Gremlin if you want to script, but I am a bit out of my league for an example ... Cheers, /peter ne

Re: [Neo4j] Cypher Aggregation functions - specifically SUM()

Now that we've figured all that out, and determined that it's not built-in to Cypher yet... What is the best practice for doing this with the available tools? I mean effectively what I'm looking for is the heaviest branch on a tree right? -- View this message in context: http://neo4j-community-

Re: [Neo4j] Cypher Aggregation functions - specifically SUM()

Hi, Thanks for considering my input and getting back to me on this issue. I'm glad to hear that this kind of functionality is being though out, because its addition to Cypher will significantly enhance its usefulness as a robust graph traversal/query language. Andres Taylor wrote: > >1. Cy

Re: [Neo4j] Cypher Aggregation functions - specifically SUM()

Hi there, Aggregation today only aggregates data over multiple subgraphs. Your query produces one subgraph per path, and that is why you can't do what you want to do. This is definitely something I want Cypher to support. The way I see this working is two steps: 1. Cypher needs a way to tur

Re: [Neo4j] Cypher Aggregation functions - specifically SUM()

Hi, You're correct in one sense. If I remove the path, or other columns, from the RETURN statement then I can get a single SUM value back for all the properties in the entire tree below my starting node. My problem is that I want to return multiple rows, a row for each path through the graph, wi