STR trees and how they are different from an R-tree?

Question

What is an STR tree ? How is it different from an R-tree ? . Whenever I search for 'STR-trees' I'm getting the search result of an R-tree . Can someone help me with this ?

Answer 1

Looks like there is a Java class for query-only R-trees called STRtree that uses the Sort-Tile-Recursive algorithm. Here is a link: http://www.vividsolutions.com/jts/javadoc/com/vividsolutions/jts/index/strtree/STRtree.html

Answer 2

Can you provide a reference for an STR-tree? I've never seen it mentioned.

I only know the Sort-Tile-Recursive bulk-loading strategy for the R-tree. So it is an R-tree then.

Answer 3

Actually, STR-tree is a spatio-temporal R-tree, which is mainly used for a moving object, see Novel Approaches to the Indexing of Moving Object Trajectories. STRtree is a packed R-tree by using Sort-Tile-Recursive, see STR: A Simple and Efficient Algorithm for R-Tree Packing. The abbreviation STRtree is not commonly used.