R-Tree

Partitioning: Uses rectangular bounding boxes (MBRs) to partition spatial data.

Space Coverage: Only covers the areas occupied by data; not the entire space.

Region Overlap: Yes, overlapping regions are common, leading to possible inefficiencies.

Complexity: Depends on tree height; generally slower in high dimensions due to overlaps.

Query Type: Best suited for range queries and spatial indexing.

Use Case: Ideal for geographic information systems (GIS), computer graphics, and dynamic spatial databases.