Search and clustering vectors in C++
-
Updated
Jan 2, 2021 - C++
Search and clustering vectors in 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.
Implemented B+ Tree for executing range queries on large SQL records
Memory-resident B+ tree implementation, supporting insertion, key based search, bound based search and range search operations.
A Python implementation of Priority R-Tree, an alternative to RTree.
Octree/Quadtree/N-dimensional linear tree
Add a description, image, and links to the range-search topic page so that developers can more easily learn about it.
To associate your repository with the range-search topic, visit your repo's landing page and select "manage topics."