Hi, all. I want to ask what type of index is better to create for bigint types. I have table with bigint (bigserial) primary key. What type is better to use for it? I tried btree and hash, but didn't notice any differences in execution time. For GiST and GIN there is a trouble that I must create operator class, so I limited myself to use btree or hash. But if it's better to use gist or gin, coment are welcome.
If you use BIGINT, I presume you will have lots of different values, in that case the best one is the btree. It is the most common and most optimized index type. GiST's strength is in using indexes for stuff that can't be done with a simple btree : geometry, full text, ltree, etc, but gist is slower in the case of indexing a simple value. GIN indexes are more compact and very fast for reads but updating is very slow (they are meant for mostly read-only tables). Hash is a bit of a fossil. Also it does not support range queries, so if you need that, btree is definitely better.
