Do you know what packing algorithm (how the rectangles are ordered in the node) is used in jsi implementation?. (Hilbert sort, sort-tile-recursive, etc). This paper explains these algoritms. "STR: A Simple and Efficient Algorithm for R-Tree Packing".
The jsi library implements a plain rtree, with no ordering within the node.
Did you mean to post a link to the paper you mention?