| From: | Kyotaro HORIGUCHI <horiguchi(dot)kyotaro(at)lab(dot)ntt(dot)co(dot)jp> |
|---|---|
| To: | pierce(at)hogranch(dot)com |
| Cc: | pgsql-general(at)postgresql(dot)org |
| Subject: | Re: Partitioning |
| Date: | 2015-01-19 08:42:06 |
| Message-ID: | 20150119.174206.239009046.horiguchi.kyotaro@lab.ntt.co.jp |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-general |
Hi,
At Mon, 19 Jan 2015 00:14:55 -0800, John R Pierce <pierce(at)hogranch(dot)com> wrote in <54BCBCFF(dot)5040100(at)hogranch(dot)com>
> On 1/18/2015 11:59 PM, James Sewell wrote:
> >
> > Actually this brings up another question, if I have an unique integer
> > index of 2.gb <http://2.gb> what percentage would I expect to read for
> > a value that was higher or lower than all index values?
>
> a couple 8k blocks. its a b-tree.
Yeah, scanning children reading highest/lowest values for each of
them would make it faster than the first single query.
regards,
--
Kyotaro Horiguchi
NTT Open Source Software Center
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Kyotaro HORIGUCHI | 2015-01-19 11:00:51 | Re: Partitioning |
| Previous Message | John R Pierce | 2015-01-19 08:14:55 | Re: Partitioning |