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

distributed rtree #18

Open
keewis opened this issue Dec 28, 2024 · 0 comments
Open

distributed rtree #18

keewis opened this issue Dec 28, 2024 · 0 comments

Comments

@keewis
Copy link
Owner

keewis commented Dec 28, 2024

To be able to query the tree when the source grid, the target grid, and the sparse adjacency matrix do not fit into memory together (or on their own) we need to create a distributed tree. There's different ways of implementing it, but for all of them we need:

  1. a way to spatially chunk the source and target grids, and to reconstruct the chunk schemes if the spatial chunking is unknown
  2. a separate tree for the spatial chunking of the source grid
  3. a way to create trees for the data within the chunks
  4. a way to aggregate the queried cells as a chunked sparse matrix
@keewis keewis mentioned this issue Dec 31, 2024
1 task
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