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

Implement efficient range queries #14

Open
marten-de-vries opened this issue May 28, 2021 · 0 comments
Open

Implement efficient range queries #14

marten-de-vries opened this issue May 28, 2021 · 0 comments
Labels
enhancement New feature or request performance

Comments

@marten-de-vries
Copy link
Owner

There's basic map/reduce support, but it implements aggregation using a table scan. That doesn't scale.

It would be nice to optimize it. The 'overlay indexes' described by Pennino, Pizzonia and Papi (2019) seem like a nice fit. See for example code: https://github.com/kdbtree/kdbtree/ .

A 'simple' skiplist might be easier, but it's not as elegant, as it requires more roundtrips to the backend database.

Diego Pennino, Maurizio Pizzonia, Alessio Papi. Overlay Indexes: Efficiently Supporting Aggregate Range Queries and Authenticated Data Structures in Off-the-Shelf Databases. IEEE Access. 7:175642-175670. 2019.

Follow-up issue of #8.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request performance
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@marten-de-vries