Re: B-tree fan-out

Поиск
Список
Период
Сортировка
От Martijn van Oosterhout
Тема Re: B-tree fan-out
Дата
Msg-id 20070623163403.GE11248@svana.org
обсуждение исходный текст
Ответ на Re: B-tree fan-out  (cluster <skrald@amossen.dk>)
Список pgsql-general
On Sat, Jun 23, 2007 at 05:58:51PM +0200, cluster wrote:
> >In any case, I think the answer to your original question is that the
> >fan-out can be up to several hundred per level, but it's not fixed.
>
> OK, its beginning to make sense. So the fan-out is given by the key size
> and each child node is stored in its own page. Is that correct?

I beleive so, yes. Each branch is a page that points to many either
branches or leaves. A leaf is also a page which can contain many keys,
which reference tuples in the actual table.

Have a nice day,
--
Martijn van Oosterhout   <kleptog@svana.org>   http://svana.org/kleptog/
> From each according to his ability. To each according to his ability to litigate.

Вложения

В списке pgsql-general по дате отправления:

Предыдущее
От: Gunther Mayer
Дата:
Сообщение: minimum function
Следующее
От: Raymond O'Donnell
Дата:
Сообщение: Re: minimum function