Re: B-tree index with sorting question

From: bricklen <bricklen(at)gmail(dot)com>
To: pgsql-general(at)postgresql(dot)org
Subject: Re: B-tree index with sorting question
Date: 2010-12-29 14:59:53
Message-ID: AANLkTik2jjNssFjVp+Ho01S2H3f6O9XcnFLxLj=F5yX-@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

On Tue, Dec 28, 2010 at 11:04 PM, Guillaume Lelarge
<guillaume(at)lelarge(dot)info> wrote:
> Le 29/12/2010 05:28, Bricklen a écrit :
>> On 2010-12-28, at 5:22 PM, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> wrote:
>>
>>> bricklen <bricklen(at)gmail(dot)com> writes:
>>>> In the docs at http://www.postgresql.org/docs/9.0/static/sql-createindex.html,
>>>> I see that you can build indexes that include ordering.
>>>> Eg. create index t_col_idx on t (col DESC NULLS LAST);
>>>
>>>> Does that mean that the initial creation of the index acts like the
>>>> CLUSTER command?
>>>
>>> No, it just changes the order that the index keeps its entries in.
>>>
>>>            regards, tom lane
>>
>> And that holds true for all subsequents inserts too?
>
> Yes, but still only the index entries.
>

Great, thanks for the clarifications!

In response to

Browse pgsql-general by date

  From Date Subject
Next Message Andrew Sullivan 2010-12-29 15:26:06 Re: Any way to use refcursors from python?
Previous Message Daniele Varrazzo 2010-12-29 14:05:26 Re: Any way to use refcursors from python?