Invention Grant
- Patent Title: Efficient lookup in multiple bloom filters
-
Application No.: US14952938Application Date: 2015-11-26
-
Publication No.: US10691731B2Publication Date: 2020-06-23
- Inventor: Chen Chen , Avraham Harpaz , Nir Naaman , Yoav Tock
- Applicant: International Business Machines Corporation
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agent Ziv Glazberg
- Main IPC: G06F16/31
- IPC: G06F16/31

Abstract:
A method comprising obtaining a Bloom filter array, wherein a size of a first Bloom filter is smaller than a size of a second Bloom filter and modifying at least a portion of the plurality of Bloom filters to create a modified Bloom filter array comprising a modified plurality of Bloom filters each of which having a same size, wherein the same size is greater than the size of the first Bloom filter, wherein said modifying comprises: duplicating the first Bloom filter to create a modified first Bloom filter comprising two or more concatenated copies of the first Bloom filter. The method may also include performing lookup in the Bloom filter array by computing a hash value of a key and accessing a bit in the hash value location in each Bloom filter of the modified Bloom filter array to determine lookup outcome in each Bloom filter.
Public/Granted literature
- US20170154099A1 EFFICIENT LOOKUP IN MULTIPLE BLOOM FILTERS Public/Granted day:2017-06-01
Information query