Re: Faster inserts with mostly-monotonically increasing values
| От | Heikki Linnakangas |
|---|---|
| Тема | Re: Faster inserts with mostly-monotonically increasing values |
| Дата | |
| Msg-id | 16816f20-db29-f280-1830-7580885684b2@iki.fi обсуждение исходный текст |
| Ответ на | Re: Faster inserts with mostly-monotonically increasing values (Andrew Dunstan <andrew.dunstan@2ndquadrant.com>) |
| Ответы |
Re: Faster inserts with mostly-monotonically increasing values
|
| Список | pgsql-hackers |
> /* XLOG stuff */
> if (RelationNeedsWAL(rel))
> {
> ...
>
> if (P_ISLEAF(lpageop))
> {
> xlinfo = XLOG_BTREE_INSERT_LEAF;
>
> /*
> * Cache the block information if we just inserted into the
> * rightmost leaf page of the index.
> */
> if (P_RIGHTMOST(lpageop))
> RelationSetTargetBlock(rel, BufferGetBlockNumber(buf));
> }
> ...
Why is this RelationSetTargetBlock() call inside the "XLOG stuff" block?
ISTM that we're failing to take advantage of this optimization for
unlogged tables, for no particular reason. Just an oversight?
- Heikki
В списке pgsql-hackers по дате отправления: