Hi,
Here's an idea: when a user ask for an Hash Index transparently build a
BTree index over an hash function instead.
Advantages:
- it works - it's crash safe - it's (much?) faster than a hash index anyways
Drawbacks:
- root access concurrency - we need a hash_any function stable against pg_upgrade
After talking about it with Heikki, we don't seem to find ways in which
the root access concurrency pattern would be visible enough to matter.
Also, talking with Peter Geoghegan, it's unclear that there's a use case
where a hash index would be faster than a btree index over the hash
function.
Comments?
--
Dimitri Fontaine
http://2ndQuadrant.fr PostgreSQL : Expertise, Formation et Support
