Hi,
currently we IIRC use linearly sorted datums for the search in
individual btree nodes. Not surprisingly that's often one of the
dominant entries in profiles. We could probably improve upon that by
using an order more optimized for efficient binary search.
See e.g. http://cglab.ca/~morin/misc/arraylayout/ for benchmarks
showing benefits.
Andres
