On 2015-05-10 09:55 AM, Stig Christensen wrote:
I'm storing millions of hash values in an indexed column of type binary and is
struck by slow inserts because of the
random nature.
Are there any tricks to gain better performance?
Typically the trick is known as sharding/clustering.
You find some way to split the table into multiple tables such that your application can easily determine which table to
use.
Oracle has built-in support for this kind of trick, but it's fairly easy to
implement by hand.
--
You received this message because you are subscribed to the Google Groups "H2
Database" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/h2-database.
For more options, visit https://groups.google.com/d/optout.
