Improving penalty function of R-tree over generalized index search tree possible way to advance performance of PostgreSQL cube extension
Andrey Borodin, Sergey Mirvoda, Sergey V. Porshnev, Mikhail Bakhterev · 2017
Generalized index search tree (GiST) greatly simplifies data access methods development. Important parts like query processing, failure recovery, memory management are implemented in generic code, so access method developer has to implement only specifics of the desired algorithm. But this generality comes with a significant cost of fitting a method for GiST API. In this paper we present number of tweaks to the R-tree implementation inside PostgreSQL GiST framework and analyze possible ways of GiST API advancements.