On Wed, Jun 26, 2013 at 05:10:00PM +0300, Heikki Linnakangas wrote: > In practice, there might be a lot of quirks and inefficiencies and > locking contention etc. involved in various DBMS's, that you might > be able to work around with hash partitioning. But from a > theoretical point of view, there is no reason to expect just > partitioning a table on a hash to make key-value lookups any faster.
Good analysis. Has anyone benchmarked this to know our btree is efficient in this area? -- Bruce Momjian <br...@momjian.us> http://momjian.us EnterpriseDB http://enterprisedb.com + It's impossible for everything to be true. + -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
