On Mon, Jun 6, 2011 at 2:51 PM, Heikki Linnakangas < heikki.linnakan...@enterprisedb.com> wrote:
> Do you think there's some worst-case data distributions where this > algorithm would perform particularly badly? > I think there could be some worst-case GiST applications. Just now gist fast build algorithm invokes more penalty calls than repeatable insert algorithm. If I succeed then it will invoke even more such calls. So, if penalty function is very slow then gist fast build will be slover then repeatable insert. ------ With best regards, Alexander Korotkov.
