Skip site navigation (1) Skip section navigation (2)

Re: [CFReview] Red-Black Tree

From: Robert Haas <robertmhaas(at)gmail(dot)com>
To: Teodor Sigaev <teodor(at)sigaev(dot)ru>
Cc: Mark Cave-Ayland <mark(dot)cave-ayland(at)siriusit(dot)co(dot)uk>, Pgsql Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: [CFReview] Red-Black Tree
Date: 2010-02-03 16:11:12
Message-ID: (view raw or whole thread)
Lists: pgsql-hackers
On Wed, Feb 3, 2010 at 8:48 AM, Robert Haas <robertmhaas(at)gmail(dot)com> wrote:
> 2010/2/3 Teodor Sigaev <teodor(at)sigaev(dot)ru>:
>>> Can you rename RED and BLACK to RBRED and RBBLACK?
>> Yes, of course, done.
>> Any objections to commit?
> I would like to see point #2 of the following email addressed before
> commit.  As things stand, it is not clear (at least to me) whether
> this is a win.

Specifically, on this web page:

There is a section that begins with this line of text:

Repeat test with 100,000 identical records varying array length (len).

That test shows rbtree being a third slower than HEAD.  But there's
not enough information on that web page to replicate that test, so
it's hard to speculate on what may be going wrong.  I don't think we
should commit this until we understand that.


In response to


pgsql-hackers by date

Next:From: Tom LaneDate: 2010-02-03 16:13:47
Subject: Re: Review of Writeable CTE Patch
Previous:From: Tom LaneDate: 2010-02-03 16:09:29
Subject: Re: Recent vendor SSL renegotiation patches break PostgreSQL

Privacy Policy | About PostgreSQL
Copyright © 1996-2015 The PostgreSQL Global Development Group