Re: INSERT ... ON CONFLICT DO UPDATE
| От | Geoff Winkless |
|---|---|
| Тема | Re: INSERT ... ON CONFLICT DO UPDATE |
| Дата | |
| Msg-id | CAEzk6fdwdZvRPQY-pvCGHq_VigM7JkhwvnBa+Je4ZdOhRy8UEw@mail.gmail.com обсуждение исходный текст |
| Ответ на | Re: INSERT ... ON CONFLICT DO UPDATE (Rafal Pietrak <rafal@ztk-rp.eu>) |
| Ответы |
Re: INSERT ... ON CONFLICT DO UPDATE
Re: INSERT ... ON CONFLICT DO UPDATE Re: INSERT ... ON CONFLICT DO UPDATE |
| Список | pgsql-general |
If I'm not mistaken, the conclusions from posts in this thread are:
3. there are methods (like cryptographic "random" sequence), which
guarantee no conflicts. So one should resort to that.
Some web research suggests that random sequences are not great for indexes because of the resultant "keyspace fragmentation". I'm assuming that means a low number of nodes in the btree leafs, so an increase in memory usage for the index?
Just a thought.
Geoff
В списке pgsql-general по дате отправления: