From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
---|---|
To: | "Steinar H(dot) Gunderson" <sgunderson(at)bigfoot(dot)com> |
Cc: | pgsql-performance(at)postgresql(dot)org |
Subject: | Re: [GENERAL] Creation of tsearch2 index is very slow |
Date: | 2006-01-20 23:52:37 |
Message-ID: | 6532.1137801157@sss.pgh.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general pgsql-performance |
"Steinar H. Gunderson" <sgunderson(at)bigfoot(dot)com> writes:
> For the record: Could we do with a less-than-optimal split here?
Yeah, I was wondering the same. The code is basically choosing two
"seed" values to drive the index-page split. Intuitively it seems that
"pretty far apart" would be nearly as good as "absolute furthest apart"
for this purpose.
The cost of a less-than-optimal split would be paid on all subsequent
index accesses, though, so it's not clear how far we can afford to go in
this direction.
It's also worth considering that the entire approach is a heuristic,
really --- getting the furthest-apart pair of seeds doesn't guarantee
an optimal split as far as I can see. Maybe there's some totally
different way to do it.
regards, tom lane
From | Date | Subject | |
---|---|---|---|
Next Message | Michael Fuhr | 2006-01-20 23:54:00 | Re: standard normal cumulative distribution function |
Previous Message | Jim C. Nasby | 2006-01-20 23:42:05 | Re: Page-Level Encryption |
From | Date | Subject | |
---|---|---|---|
Next Message | Steinar H. Gunderson | 2006-01-21 00:05:19 | Re: [GENERAL] Creation of tsearch2 index is very slow |
Previous Message | Steinar H. Gunderson | 2006-01-20 23:28:43 | Re: [GENERAL] Creation of tsearch2 index is very slow |