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

fetch_adjacencies(): Fast-path for simple cases #18

Open
stuarteberg opened this issue Aug 7, 2020 · 0 comments
Open

fetch_adjacencies(): Fast-path for simple cases #18

stuarteberg opened this issue Aug 7, 2020 · 0 comments

Comments

@stuarteberg
Copy link
Collaborator

stuarteberg commented Aug 7, 2020

In simple cases involving explicit lists of relatively few bodies, fetch_adjacencies() has high latency due to extra calls to neuprint. Common simple cases could be special-cased to speed them up.

The fetch_adjacencies() function is designed to perform well (avoid timeouts) even when the source or target NeuronCriteria involves thousands of bodies. To support that, it sends some initial queries to assess the size of the source/target body lists and then pre-fetch the complete body list for one of them. But in cases where the body list is explicitly provided by the user, we could implement a special fast-path that avoids those extra calls. That would improve interactive latency for such calls.

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

1 participant