| From: | Simon Riggs <simon(at)2ndQuadrant(dot)com> |
|---|---|
| To: | konstantin knizhnik <k(dot)knizhnik(at)postgrespro(dot)ru> |
| Cc: | Simon Riggs <simon(at)2ndquadrant(dot)com>, Anastasia Lubennikova <a(dot)lubennikova(at)postgrespro(dot)ru>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Batch update of indexes |
| Date: | 2016-01-21 07:14:04 |
| Message-ID: | CANP8+j+DMVfE5KAtRG9EtJMjEiNPFrX=z9Pp6SzBRTodMmFDtg@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On 21 January 2016 at 06:41, konstantin knizhnik <k(dot)knizhnik(at)postgrespro(dot)ru>
wrote:
> Certainly for B-Tree we can organize insert buffer (or pending list) as
> sorted array or also as a tree.
> But in both case complexity of search in this buffer will be O(log(N)),
> not O(1).
>
You are right; search within this buffer is O(log(N)). But we can test
whether we need to search in the buffer at all with O(1).
--
Simon Riggs http://www.2ndQuadrant.com/
<http://www.2ndquadrant.com/>
PostgreSQL Development, 24x7 Support, Remote DBA, Training & Services
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Andres Freund | 2016-01-21 08:11:40 | Re: checkpointer continuous flushing |
| Previous Message | konstantin knizhnik | 2016-01-21 06:41:43 | Re: Batch update of indexes |