Re: Fast insertion indexes: why no developments

From: Simon Riggs <simon(at)2ndQuadrant(dot)com>
To: Leonardo Francalanci <m_lists(at)yahoo(dot)it>
Cc: pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Fast insertion indexes: why no developments
Date: 2013-10-30 09:10:39
Message-ID: CA+U5nMJtG_3yBxzKnfRgiGdfUia+KNAnduO+prZx-VptBSe7Bw@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On 30 October 2013 07:55, Leonardo Francalanci <m_lists(at)yahoo(dot)it> wrote:
>> Hmm, you realise Alvaro is working on MinMax indexes in this release?
>> They are very efficient with regard to index inserts and specially
>> designed for use on large tables.
>>
>> Prior work by Heikki on Grouped Item Tuples was a way of reducing the
>> size of indexes, yet still allowing uniqueness checks. That is
>> implemented in SQLServer already and is very useful.
>
>
> Reading the implementation of those features, I don't think they can help in the cases handled by the index types I mentioned (insertions of random values in big tables).

Presumably the data you are inserting isn't actually random. Please
describe the use case you are considering in more detail and some view
on how frequent that is, with some examples. Once we understand the
use case and agree it is important, we might solve problems.

--
Simon Riggs http://www.2ndQuadrant.com/
PostgreSQL Development, 24x7 Support, Training & Services

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Leonardo Francalanci 2013-10-30 10:35:10 Re: Fast insertion indexes: why no developments
Previous Message David Rowley 2013-10-30 08:51:57 Re: appendStringInfo vs appendStringInfoString