On-Disk Implementation of R-Tree with Insertion and Bulk Load. This data structure efficiently stores and retrieve multi-dimensional data, very similar to B+ Tree where data is 1D though.
-
Updated
Jun 27, 2020 - C++
On-Disk Implementation of R-Tree with Insertion and Bulk Load. This data structure efficiently stores and retrieve multi-dimensional data, very similar to B+ Tree where data is 1D though.
Add a description, image, and links to the ondisk topic page so that developers can more easily learn about it.
To associate your repository with the ondisk topic, visit your repo's landing page and select "manage topics."