Open maartenc opened 2 years ago
It looks like the current R*-tree implementation doesn't re-insert entries if a node is split. See chapter 4.3 in https://infolab.usc.edu/csci599/Fall2001/paper/rstar-tree.pdf
Would it be possible to add support for this?
Thanks, I'll have a look. What benefit are you expecting? Improved performance?
Having read that section I see that yes perf might improve.
It looks like the current R*-tree implementation doesn't re-insert entries if a node is split. See chapter 4.3 in https://infolab.usc.edu/csci599/Fall2001/paper/rstar-tree.pdf
Would it be possible to add support for this?