[
https://issues.apache.org/jira/browse/HBASE-7884?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13582792#comment-13582792
]
clockfly commented on HBASE-7884:
---------------------------------
Hi Ted,
The hash logic is equilvalent.
for (int i = 0; i < hashCount; i++) {
long hashLoc = Math.abs((hash1 + i * hash2) % bloomBitSize);
}
is equilvalent as
int compositeHash = hash1;
for (int i = 0; i < hashCount; i++) {
int hashLoc = Math.abs(compositeHash % bloomBitSize);
compositeHash += hash2;
}
> ByteBloomFilter's performance can be improved by avoiding multiplication when
> generating hash
> ----------------------------------------------------------------------------------------------
>
> Key: HBASE-7884
> URL: https://issues.apache.org/jira/browse/HBASE-7884
> Project: HBase
> Issue Type: Bug
> Components: Performance
> Affects Versions: 0.94.5
> Reporter: clockfly
> Priority: Minor
> Attachments: bloom_optimization_trunk_patch.patch,
> bloom_performance_tunning.patch
>
>
> ByteBloomFilter's performance can be optimized by avoiding multiplication
> operation when generating hash
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira
