You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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:
a way to spatially chunk the source and target grids, and to reconstruct the chunk schemes if the spatial chunking is unknown
a separate tree for the spatial chunking of the source grid
a way to create trees for the data within the chunks
a way to aggregate the queried cells as a chunked sparse matrix
The text was updated successfully, but these errors were encountered:
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:
The text was updated successfully, but these errors were encountered: