Re: btree.sgml typo?

From: Peter Geoghegan <pg(at)bowt(dot)ie>
To: Tatsuo Ishii <ishii(at)sraoss(dot)co(dot)jp>
Cc: PostgreSQL Hackers <pgsql-hackers(at)lists(dot)postgresql(dot)org>
Subject: Re: btree.sgml typo?
Date: 2019-01-05 17:41:37
Message-ID: CAH2-Wz=QZ4FfJSR0uaFKfp8cW7_2FvwY=udUaxzf2x+Shjqkwg@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Sat, Jan 5, 2019 at 1:35 AM Tatsuo Ishii <ishii(at)sraoss(dot)co(dot)jp> wrote:
> <productname>PostgreSQL</productname> includes an implementation of the
> standard <acronym>btree</acronym> (multi-way binary tree) index data
> structure.
>
> I think the term "btree" here means "multi-way balanced tree", rather
> than "multi-way binary tree". In fact in our btree, there could be
> more than one key in a node. Patch attached.

+1 for applying this patch. The existing wording is highly confusing,
especially because many people already incorrectly think that a B-Tree
is just like a self-balancing binary search tree.

There is no consensus on exactly what the "b" actually stands for, but
it's definitely not "binary". I suppose that the original author meant
that a B-Tree is a generalization of a binary tree, which is basically
true -- though that's a very academic point.
--
Peter Geoghegan

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Stephen Frost 2019-01-05 18:16:06 Re: Remove Deprecated Exclusive Backup Mode
Previous Message Tom Lane 2019-01-05 17:30:34 Re: [proposal] Add an option for returning SQLSTATE in psql error message