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