I am trying to understand the Tree Indexing method of the Road network. In R-Tree the Minimum Bounding Rectangle is used to store the data points, but how it can hold the line segments of the Map? Or each MBR will just hold the single edge of the roadmap? From a basic Spatial Join what I got is that the connected line segment's rectangle overlaps. Still it seems a lot of confusing to me. Could anybody please help me with the simple yet easy explanation. A graphical visualization would be more helpful.
Ordinary R-Trees in GIS do not consider the topology/connections of the edges in sense of graph theory.
The MBR of each feature is considered in the R-Tree on its own, depending only on its spatial position, not on connections to any other road segments.