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

Subset network query #249

Open
gotdairyya opened this issue May 10, 2021 · 2 comments
Open

Subset network query #249

gotdairyya opened this issue May 10, 2021 · 2 comments

Comments

@gotdairyya
Copy link
Contributor

Opening an issue as the start of a discussion: how do we want to enable network querying?
Is it by the number of nodes or 1-hop paths?

@gotdairyya gotdairyya mentioned this issue May 10, 2021
4 tasks
@JackWilb
Copy link
Member

After a little deliberation on slack, we decided to get subset of nodes and all of the edges that exist in the subset. Ultimately, we're not limited by the number of links, so that seems appropriate. The implementation of this approach is most simple and easy to debug.

This strategy won't work for very large graphs (since the chance of any nodes in a sample being connected might be low). In that case we should suggest path traversals in the overlay, and we'd have a more complex query

@gotdairyya
Copy link
Contributor Author

I'd like to add that right now we are always taking the first n number of nodes in the node table, and that we should consider other, potentially better alternatives.

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

No branches or pull requests

2 participants