# tree-based

> Browse 5 items tagged with tree-based.

## Items

- [Tree-Based Indexing](https://vectordb.ever.works/items/tree-based-indexing) — A family of vector indexing methods using tree data structures like KD-trees, Ball-trees, and R-trees for spatial partitioning. Provides logarithmic search complexity for low to medium dimensional data, though effectiveness decreases in very high dimensions.
- [Ball-Tree](https://vectordb.ever.works/items/ball-tree) — Tree-based spatial data structure organizing vectors using spherical regions instead of axis-aligned splits, making it better suited for high-dimensional data compared to KD-trees.
- [KD-Tree](https://vectordb.ever.works/items/kd-tree) — Tree-based data structure for organizing vectors through recursive axis-aligned partitioning, enabling logarithmic time complexity searches for balanced data but struggling with high-dimensional spaces.
- [MSTG (Multi-Stage Tree Graph)](https://vectordb.ever.works/items/mstg-multi-stage-tree-graph) — Hierarchical vector index developed by MyScale overcoming IVF limitations through multi-layered design, creating multiple layers unlike IVF's single layer of cluster vectors for improved search performance.
- [Tree-based Methods](https://vectordb.ever.works/items/tree-based-methods) — A curated list of tree-based approaches and systems for vector indexing and search, foundational for certain types of vector databases.

---

_Canonical page: https://vectordb.ever.works/tags/tree-based_