| From: | Nathan Boley <npboley(at)gmail(dot)com> |
|---|---|
| To: | David Fetter <david(at)fetter(dot)org> |
| Cc: | PG Hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Multi-Dimensional Histograms |
| Date: | 2009-06-29 23:49:50 |
| Message-ID: | 6fa3b6e20906291649h5f78776dx77474ea615959982@mail.gmail.com |
| Views: | Whole Thread | Raw Message | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
>> Finally, this creates the partition but ( AFAICT ) it doesn't describe
>> a method for locating the histogram estimate given a point ( although
>> that doesn't seem too difficult ).
> Is that "not difficult," in terms of the math that needs doing, or
> "not difficult," in terms of how well PostgreSQL is already set up to
> implement, or...?
>
I only meant that any implementation would need to address this, but I
can think of simple ways to do it ( for instance, use the fixed width
grid method, and then store a reference to all of the intersecting
boxes ). But I am sure that there are much better ways ( nested
containment lists perhaps? ).
-Nathan
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Ron Mayer | 2009-06-30 00:15:04 | Re: Query progress indication - an implementation |
| Previous Message | Greg Stark | 2009-06-29 23:34:49 | Re: Query progress indication - an implementation |