“R-tree is useful to store spatial objects such as restaurant locations”. I see this sentence a lot of time in internet but I haven't found the good explanation on this.

Can anybody please elaborate the steps involved in indexing spatial objects?

I have been trying to get an intuitive answer to understand the working concept of R-Trees. Like how a minimum bounding box is determined? How the objects are inserted into that bounding box? I have read and understand that MBR are used to store data points and the trees are formed on the basis of the bounding box. But how can someone fit a map in a graph of a size of an A4 size and use the spatial objects(restaurants, cafes etc) as a data point and then enclose those points in a MBR of what size, and then index them in a tree?

I do not understand this concept; it’s really more complicated than I thought. Would be more convincing if a real world based scenario is used to explain.

closed as too broad by BERA, Vince, Jochen Schwarze, ahmadhanb, John Powell Feb 14 at 11:13

Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

  • Your question is to broad, take the tour please. – BERA Feb 14 at 10:08
  • Have you read the wikipedia R-tree page? It's quite good. – John Powell Feb 14 at 11:13
  • Yes, I went through all the stuffs and the main paper too by Antonian Guttman, but there's not much comprehending explanation. That's the reason why I posted this along with an brief problem that I am not understanding. – Aavash Bhandari Feb 15 at 1:15