GIN Index for low cardinality
От | Ravi Krishna |
---|---|
Тема | GIN Index for low cardinality |
Дата | |
Msg-id | E260AEE7-95B3-4142-9A4B-A4416F1701F0@aol.com обсуждение исходный текст |
Ответ на | Re: Problem creating a database (Joshua White <joshua.white@monash.edu>) |
Ответы |
Re: GIN Index for low cardinality
Re: GIN Index for low cardinality |
Список | pgsql-general |
In https://www.cybertec-postgresql.com/en/ideas-for-scaling-postgresql-to-multi-terabyte-and-beyond/
it is mentioned:
"GIN, the most know non-default index type perhaps, has been actually around for ages (full-text search) and in short is perfect for indexing columns where there are lot of repeating values – think all kinds of statuses or good old Mr/Mrs/Miss. GIN only stores every unique column value only once as for the default B-tree you’ll have e.g. 1 millon leaf nodes with the integer “1” in it."
Does it mean that GIN is a very good choice for low cardinality columns.
В списке pgsql-general по дате отправления: