1. The priority R-tree
2. Martin Aumüller and Matteo Ceccarello . 2020. Running Experiments with Confidence and Sanity . In SISAP(LNCS, Vol. 12440) . Springer , 387–395. Martin Aumüller and Matteo Ceccarello. 2020. Running Experiments with Confidence and Sanity. In SISAP(LNCS, Vol. 12440). Springer, 387–395.
3. Norbert Beckmann , Hans-Peter Kriegel , Ralf Schneider , and Bernhard Seeger . 1990. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles . In SIGMOD. ACM Press , 322–331. Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger. 1990. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In SIGMOD. ACM Press, 322–331.
4. Andreas Behrend , Anton Dignös , Johann Gamper , Philip Schmiegelt , Hannes Voigt , Matthias Rottmann , and Karsten Kahl . 2019 . Period Index: A Learned 2D Hash Index for Range and Duration Queries. In SSTD. ACM, 100–109. Andreas Behrend, Anton Dignös, Johann Gamper, Philip Schmiegelt, Hannes Voigt, Matthias Rottmann, and Karsten Kahl. 2019. Period Index: A Learned 2D Hash Index for Range and Duration Queries. In SSTD. ACM, 100–109.
5. Andreas Behrend , Rainer Manthey , Gereon Schüller , and Monika Wieneke . 2009. Detecting Moving Objects in Noisy Radar Data Using a Relational Database . In ADBIS(LNCS, Vol. 5739) . Springer , 286–300. Andreas Behrend, Rainer Manthey, Gereon Schüller, and Monika Wieneke. 2009. Detecting Moving Objects in Noisy Radar Data Using a Relational Database. In ADBIS(LNCS, Vol. 5739). Springer, 286–300.