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.

Sign up for GitHub

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

Jump to bottom

Use more efficient search-based approach for auto-completion #48

Open

szschaler opened this issue Jun 10, 2020 · 0 comments

Member

szschaler commented Jun 10, 2020

Currently, auto-completion is effectively a brute-force search, which can become quite expensive. Should explore whether search-based approaches such as https://www.sciencedirect.com/science/article/pii/S0164121214001484 or work from sub-graph matching (e.g., https://github.com/ciaranm/glasgow-subgraph-solver) can help improve this.

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