asterixdb-notifications mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "ASF subversion and git services (JIRA)" <>
Subject [jira] [Commented] (ASTERIXDB-2186) Cache-friendly bloom filter
Date Fri, 15 Dec 2017 22:33:00 GMT


ASF subversion and git services commented on ASTERIXDB-2186:

Commit ed503080786d6ab0694b68b0965f18edad9ceaa5 in asterixdb's branch refs/heads/master from
[;h=ed50308 ]

[ASTERIXDB-2186][STO] Cache-friendly Bloom Filter

- user model changes: no
- storage format changes: yes. Change the format of bloom filter
- interface changes: no

- Introduce blocked bloom filter to guarantee only 1 random memory
access is required during each membership check. It improves bloom
filter performance by 2x - 4x, depending on the ratio of positive
- For legacy bloom filters, we fall back to previous implementation
based on the stored version in the metadata.
- Add pinAllPages/unpinAllPages method to reduce pin/unpin overhead.

Change-Id: I0e8e0db9b60d5addfaf61ebb372a1bcb2d2d5957
Sonar-Qube: Jenkins <>
Integration-Tests: Jenkins <>
Tested-by: Jenkins <>
Contrib: Jenkins <>
Reviewed-by: Ian Maxon <>

> Cache-friendly bloom filter
> ---------------------------
>                 Key: ASTERIXDB-2186
>                 URL:
>             Project: Apache AsterixDB
>          Issue Type: Improvement
>          Components: STO - Storage
>            Reporter: Chen Luo
>            Assignee: Chen Luo
> The current implementation of bloom filter is not cache friendly. A membership check
needs to perform multiple hash probes, each of which requires a separate random memory access
(i.e., cache miss).

This message was sent by Atlassian JIRA

View raw message