Re: btree index maximum row size
От | Bruce Momjian |
---|---|
Тема | Re: btree index maximum row size |
Дата | |
Msg-id | 20200313001712.GB2309@momjian.us обсуждение исходный текст |
Ответ на | btree index maximum row size (PG Doc comments form <noreply@postgresql.org>) |
Ответы |
Re: btree index maximum row size
|
Список | pgsql-docs |
On Mon, Feb 3, 2020 at 07:09:19PM +0000, PG Doc comments form wrote: > The following documentation comment has been logged on the website: > > Page: https://www.postgresql.org/docs/12/limits.html > Description: > > Appendix K (PostgreSQL Limits) - doesn't mention the (btree) index row size > limits. I think that it should. Sorry for the delay in replying. We do get questions about the btree length limit occasionally, but practically the length limit usually isn't a problem. Unless you need ordered data, a hash index is a better choice for long values than btree because the hashes are much shorter. Expression indexes can also help. What is your use-case for indexing very long values? -- Bruce Momjian <bruce@momjian.us> https://momjian.us EnterpriseDB https://enterprisedb.com + As you are, so once was I. As I am, so you will be. + + Ancient Roman grave inscription +
В списке pgsql-docs по дате отправления: