Личный кабинет
Укажите e-mail, на который будет выслан код восстановления пароля.
На указанный вами адрес e-mail был выслан код подтверждения аккаунта. Введите полученный код для продолжения:
Введите новый пароль два раза:
On 21 January 2016 at 06:41, konstantin knizhnik <k.knizhnik@postgrespro.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).
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).
-- Simon Riggs http://www.2ndQuadrant.com/PostgreSQL Development, 24x7 Support, Remote DBA, Training & Services
-- Konstantin Knizhnik Postgres Professional: http://www.postgrespro.com The Russian Postgres Company
В списке pgsql-hackers по дате отправления: