On Mon, Sep 23, 2013 at 12:47 AM, Alexander Korotkov <aekorotkov@gmail.com> wrote:
It's probably an option to select 64 entries instead of 32.
There is still some regression in update speed. However, there is also room for improvement patch. It searches item index entries 2 times on insert: in dataLocateLeafItem and dataPlaceToPage. We can save full results of dataLocateLeafItem, but it require some rework of gin btree interface: store not only offset of item.
In the attached version of patch double finding of ItemPointer during insert is avoided. Overhead becomes lower as expected.