Re: GraphX: New graph operator

i have a pull request about this issue. https://github.com/apache/spark/pull/6685 the union operation of two graph is useful in practice. And it’s necessary to provide operation on the Graph level. > On 3 Jun, 2015, at 2:58 pm, Reynold Xin wrote: >

Re: GraphX: New graph operator

I'd think id is the unique identifier by default. On Wed, Jun 3, 2015 at 12:13 AM, Tarek Auel wrote: > Hi, > > The graph is already there (GraphX) and has the two RDDs you described. My > question tries to get an idea, if the community thinks that it's a benefit > and would be a plus or not. If

Re: GraphX: New graph operator

Hi, The graph is already there (GraphX) and has the two RDDs you described. My question tries to get an idea, if the community thinks that it's a benefit and would be a plus or not. If yes, I would like to contribute it to GraphX (either as part of GraphOpts or as external library). An interestin

Re: GraphX: New graph operator

Hi Tarek, I took a quick look at the materials you shared. It actually seems to me it'd be super easy to express a graph as two DataFrames: one for edges (srcid, dstid, and other edge attributes) and one for vertices (vid, and other vertex attributes). Then intersection is just edges1.intersect

Re: GraphX: New graph operator

Okay thanks for your feedback. What is the expected behavior of union? Like Union and/or union all of SQL? Union all would be more or less trivial if we just concatenate the vertices and edges (vertex Id conflicts have to be resolved). Should union look for duplicates on the actual attribute (VD)

Re: GraphX: New graph operator

I think it would be good to have more basic operators like union or difference, as long as they have an efficient distributed implementation and are plausibly useful. If they can be written in terms of the existing GraphX API, it would be best to put them into GraphOps to keep the core GraphX impl

GraphX: New graph operator

Hello, Someone proposed in a Jira issue to implement new graph operations. Sean Owen recommended to check first with the mailing list, if this is interesting or not. So I would like to know, if it is interesting for GraphX to implement the operators like: http://en.wikipedia.org/wiki/Graph_operat