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.

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

Create new Attean plugin with HeapSort code #33

Open
kasei opened this issue Nov 18, 2015 · 1 comment
Open

Create new Attean plugin with HeapSort code #33

kasei opened this issue Nov 18, 2015 · 1 comment
Assignees
@kasei

Comments

@kasei
Copy link
Owner

kasei commented Nov 18, 2015

Pull the HeapSort implementation and planning code out of git history (removed in 05cc79c) and package it as a separate module that can extend the built-in query planning.
@kasei
Copy link
Owner Author

kasei commented Dec 1, 2015

This can also be applied as an optimization to RANK (#34) operations that include a HAVING clause that results in a limit-by-resource style query. Each group would use a heap to keep only the top-n results, and then they would be popped, extended with their rank, and emitted as a result.

@kasei kasei assigned kasei and unassigned kasei Jan 9, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@kasei kasei

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@kasei