The difference is also relevant in query design, hash indexes can not be used for range queries. The can only be used for '=' and '<=>'. They are ingored for '<', '>', 'BETWEEN' and the likes.TheWitness wrote: The hash vs btree issue is only relevant for key with value that have low cardinality (aka don't vary a lot or all the same). Since I'm on a blackberry tight now, i'll have to look at the other analysis later.
Poller performance and more
Moderators: Developers, Moderators
"Debugging is twice as hard as writing the code in the first place.
Therefore, if you write the code as cleverly as possible, you are,
by definition, not smart enough to debug it." - Brian W. Kernighan
Therefore, if you write the code as cleverly as possible, you are,
by definition, not smart enough to debug it." - Brian W. Kernighan
Who is online
Users browsing this forum: No registered users and 3 guests