Sent from my iPad
On 13-Feb-2013, at 22:21, Heikki Linnakangas <hlinnakangas@vmware.com> wrote:
> On 13.02.2013 18:43, Andrew Dunstan wrote:
>>
>> On 02/13/2013 11:20 AM, Tom Lane wrote:
>>> Heikki Linnakangas <hlinnakangas@vmware.com> writes:
>>>> The basic fractal indexes is what I've read on some presentation slides on the 'net, so I might be missing
something.
>
I think that buffering can be applied to BTree, R Tree and GisT in more or less the same manner.
Is there a way we can abstract the buffering part out of them all?
Atri
