| From: | Atri Sharma <atri(dot)jiit(at)gmail(dot)com> |
|---|---|
| To: | Heikki Linnakangas <hlinnakangas(at)vmware(dot)com> |
| Cc: | Andrew Dunstan <andrew(at)dunslane(dot)net>, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Pg Hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Fractal tree indexing |
| Date: | 2013-02-13 17:32:13 |
| Message-ID: | 99E63875-B164-4BA9-84C0-0374D040354E@gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Sent from my iPad
On 13-Feb-2013, at 22:21, Heikki Linnakangas <hlinnakangas(at)vmware(dot)com> wrote:
> On 13.02.2013 18:43, Andrew Dunstan wrote:
>>
>> On 02/13/2013 11:20 AM, Tom Lane wrote:
>>> Heikki Linnakangas <hlinnakangas(at)vmware(dot)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
| From | Date | Subject | |
|---|---|---|---|
| Next Message | David E. Wheeler | 2013-02-13 17:35:02 | Re: JSON Function Bike Shedding |
| Previous Message | Andrew Dunstan | 2013-02-13 17:31:32 | Re: JSON Function Bike Shedding |