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

SEARCH: improve stage reordering #102

Closed
jacoscaz opened this issue Aug 25, 2020 · 1 comment
Closed

SEARCH: improve stage reordering #102

jacoscaz opened this issue Aug 25, 2020 · 1 comment

Comments

@jacoscaz
Copy link
Owner

The current method is inefficient (too many wasted cycles and allocations). It's a start but it will need to be refactored into something better once we get a better grasp of whether we want to keep a flat array-like structure for search stages or whether we'll be forced to adopt a recursive structure like sparqlalgebrajs's output.

@jacoscaz jacoscaz added this to the v8.0.0 - Performance, consolidation milestone Aug 25, 2020
@jacoscaz
Copy link
Owner Author

Closing as a consequence of #104

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

1 participant