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
For a lot of queries it would be beneficial to utilize higher-dimensional indexing. An rtree-based index structure can provide a multidimensional span of values which would then allow us to quickly answer queries with multiple inequalities without a lot of discarded records.
The text was updated successfully, but these errors were encountered:
…2216)
* prototype of fetch a partial tree of an r-tree
* save point
* savepoint 2
* node splitting implemented
* save point
* inserts as rectangular queries functional
* stats test work
* insert/update/select works
* delete code path code-complete
* insert/update/delete pass unit tests
* docs
* addressed Alec's comments
For a lot of queries it would be beneficial to utilize higher-dimensional indexing. An rtree-based index structure can provide a multidimensional span of values which would then allow us to quickly answer queries with multiple inequalities without a lot of discarded records.
The text was updated successfully, but these errors were encountered: