Which index structure is designed for Multi-Dimensional spatial queries (e.g., 'Find all points inside this bounding box')?

1. A Standard B+ Tree, which utilizes a strictly linear sort order to manage multi-dimensional spatial points via a recursive partitioning algorithm.
2. B R-Tree (Rectangle Tree), which organizes objects into nested, hierarchically organized Minimum Bounding Rectangles (MBRs) for multi-dimensional pruning.
3. C LSM Tree (Log-Structured Merge Tree), which is natively optimized for high-throughput spatial write operations and real-time geofencing events.
4. D Bloom Filter, a probabilistic data structure that can instantly determine if a specific point is physically present within a geometric boundary box.