Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

new interface of vertex program for heterogeneous graph and filter #34

Open
wweic opened this issue Apr 10, 2013 · 5 comments
Open

new interface of vertex program for heterogeneous graph and filter #34

wweic opened this issue Apr 10, 2013 · 5 comments

Comments

@wweic
Copy link
Contributor

wweic commented Apr 10, 2013

how to add heterogeneous vertex/edge data and filter.

@thinxer , @neozhangthe1

@neozhangthe1
Copy link
Contributor

I think filter is similar to the map_reduce interface, it preform a function on every vertex to determine if the vertex will be filtered and finally return a subgraph without the vertices that had been filtered

@thinxer
Copy link
Contributor

thinxer commented Apr 10, 2013

For the heterogeneous part, I would separate the graph into 'vertex
partitions' and 'edge partitions'. Each partition consists of one type of
vertex or edge. Each partition has a base index number so as the whole
index space is continuous.

However, in this scheme, we need to access multiple regions for a single
enumeration operation(either vertices or edges of a vertex). Given the fact
that there is only a limited number of types, this solution may be feasible
to users.

On Wed, Apr 10, 2013 at 5:01 PM, Wei Chen [email protected] wrote:

how to add heterogeneous vertex/edge data and filter.

@thinxer https://github.com/thinxer , @neozhangthe1https://github.com/neozhangthe1


Reply to this email directly or view it on GitHubhttps://github.com//issues/34
.

@thinxer
Copy link
Contributor

thinxer commented Apr 10, 2013

Yes. We can we the mapreduce interface to transform the whole graph into
another.

We can also utilize indexing methods to do the filtering.

On Wed, Apr 10, 2013 at 5:05 PM, Yutao [email protected] wrote:

I think filter is similar to the map_reduce interface, it preform a
function on every vertex to determine if the vertex will be filtered and
finally return a subgraph without the vertices that had been filtered


Reply to this email directly or view it on GitHubhttps://github.com//issues/34#issuecomment-16162954
.

@wweic
Copy link
Contributor Author

wweic commented Apr 10, 2013

@thinxer you mean we enforce that the same type of vertex data locates in a continuous region of id? .

and @neozhangthe1, then we will cut off the template parameter vertex_data_type, edge_data_type for sae_graph, what the new gather, scatter, apply look like?

@thinxer
Copy link
Contributor

thinxer commented Apr 10, 2013

Yes I mean that. Otherwise we have to maintain a mapping which leads into
inefficiency.
On Apr 10, 2013 5:19 PM, "Wei Chen" [email protected] wrote:

@thinxer https://github.com/thinxer you mean we enforce that the same
type of vertex data locates in a continuous region of id? .

and @neozhangthe1 https://github.com/neozhangthe1, then we will cut off
the template parameter vertex_data_type, edge_data_type for sae_graph,
what the new gather, scatter, apply look like?


Reply to this email directly or view it on GitHubhttps://github.com//issues/34#issuecomment-16163472
.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

3 participants