Re: Questions about btree_gin vs btree_gist for low cardinalitycolumns - Mailing list pgsql-general

From Peter J. Holzer
Subject Re: Questions about btree_gin vs btree_gist for low cardinalitycolumns
Date
Msg-id 20190531081136.e3cmqyrji4edyxve@hjp.at
Whole thread Raw
In response to Re: Questions about btree_gin vs btree_gist for low cardinalitycolumns  ("Peter J. Holzer" <hjp-pgsql@hjp.at>)
List pgsql-general
On 2019-05-30 21:00:57 +0200, Peter J. Holzer wrote:
> Firstly, the GIN index doesn't generally index single characters. It
> uses some rule to split the field into tokens. For example, for a text
> field, it might split the field into words (possibly with some
> normalization like case-folding and stemming) for an int array it might
> use the values in the array, etc.

That was misleading: For a full text index you don't actually index the
column. You index ts_vector(columne). It is ts_vector which does the
tokenization, not the access method itself.

        hp

--
   _  | Peter J. Holzer    | we build much bigger, better disasters now
|_|_) |                    | because we have much more sophisticated
| |   | hjp@hjp.at         | management tools.
__/   | http://www.hjp.at/ | -- Ross Anderson <https://www.edge.org/>

Attachment

pgsql-general by date:

Previous
From: "Lu, Dan"
Date:
Subject: Postgresql backup via LVM snapshot?
Next
From: Thomas Kellerer
Date:
Subject: Re: Questions about btree_gin vs btree_gist for low cardinalitycolumns