]
Dan Berindei commented on ISPN-3905:
------------------------------------
[~sannegrinovero] We know {{String.hashCode()}} is much faster than MurmurHash3 when
we're calling it repeatedly on the same {{String}} instance. I was wondering if
it's still much faster when each call happens on a new {{String}} instance.
Murmurhash3 implementation is slow on String keys
-------------------------------------------------
Key: ISPN-3905
URL:
https://issues.jboss.org/browse/ISPN-3905
Project: Infinispan
Issue Type: Enhancement
Components: Core
Affects Versions: 6.0.0.Final, 6.0.1.Final
Reporter: Sanne Grinovero
Assignee: Dan Berindei
Priority: Minor
Fix For: 8.1.0.Final
String instances are a common choice for being used as key entries, still the getBytes()
operation being performed allocates costly buffers, and the computation to get those bytes
looks like expensive too.
I suspect there might be good reasons for not using the String's own hashcode
directly as an input to Murmurhash? Still that's what other implementations seem to
do.