You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@hbase.apache.org by "Walter Koetke (JIRA)" <ji...@apache.org> on 2016/03/18 01:28:33 UTC

[jira] [Updated] (HBASE-15480) Bloom Filter array access needs to be more efficient

     [ https://issues.apache.org/jira/browse/HBASE-15480?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Walter Koetke updated HBASE-15480:
----------------------------------
    Description: It is currently inefficient to do lots of bloom filter checks. Each check has overhead like going to the block cache to retrieve the block and recording metrics. It would be good to have one bloom filter check api that does a bunch of checks without so much block retrieval and metrics updates.  (was: The bloom filter implementation for an array of items is inefficient.)

> Bloom Filter array access needs to be more efficient
> ----------------------------------------------------
>
>                 Key: HBASE-15480
>                 URL: https://issues.apache.org/jira/browse/HBASE-15480
>             Project: HBase
>          Issue Type: Improvement
>          Components: Performance
>    Affects Versions: 1.0.3
>            Reporter: Walter Koetke
>            Assignee: Walter Koetke
>             Fix For: 1.0.3
>
>
> It is currently inefficient to do lots of bloom filter checks. Each check has overhead like going to the block cache to retrieve the block and recording metrics. It would be good to have one bloom filter check api that does a bunch of checks without so much block retrieval and metrics updates.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)