| From: | Hannu Krosing <hannu(at)tm(dot)ee> |
|---|---|
| To: | "Anand, VJ (MED, GEMS-IT)" <Virinchipura(dot)Anand(at)med(dot)ge(dot)com> |
| Cc: | "'pgsql-hackers(at)postgresql(dot)org'" <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: BTree index and optimizer |
| Date: | 2003-12-04 10:28:51 |
| Message-ID: | 1070533731.3498.4.camel@fuji.krosing.net |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
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
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Bruce Momjian | 2003-12-04 11:45:20 | Re: What packages from Mingw and MSys are needed? |
| Previous Message | John Sidney-Woollett | 2003-12-04 08:47:40 | Re: Transaction Question |