BTree index and optimizer

Started by Anand, VJ (MED, GEMS-IT)over 22 years ago2 messageshackers
Jump to latest
#1Anand, VJ (MED, GEMS-IT)
Virinchipura.Anand@med.ge.com

Hello:

I am trying to find out, how is the B-tree index implemented for
multiple columns? does Postgres, just
concatenate the columns --- if this is the case, then how is the
search performed? Also, does the optimizer
choose the index, only when the constraining is on the leading
subset of the index column?

Thanks
VJ

#2Hannu Krosing
hannu@tm.ee
In reply to: Anand, VJ (MED, GEMS-IT) (#1)
Re: BTree index and optimizer

Anand, VJ (MED, GEMS-IT) kirjutas K, 03.12.2003 kell 18:18:

Hello:

I am trying to find out, how is the B-tree index implemented for
multiple columns? does Postgres, just
concatenate the columns ---

Yes.

if this is the case, then how is the
search performed? Also, does the optimizer
choose the index, only when the constraining is on the leading
subset of the index column?

Yes.

If you want it more complicated, you could check out if PG's R-tree
indexes suit you.

-------------
Hannu