> The index is a B-Tree, not hashed. The order of the segments of the key > makes a big difference to queries, as pointed out earlier. It doesn't > make any significant difference to the time it takes to create of > maintain the index.
Thanks. So what's the best way to order the columns? I know for SELECT queries to order my WHERE clauses to narrow down the possible candidates as quickly as possible so is it something similar? If it's a B-Tree, that would make sense.
