IP Library Granted Patent US 11,036,737
Granted Patent B2
US 11,036,737 · App. 16/407,263 · Granted Jun 15, 2021

Partitioned bloom filter merge for massively parallel processing clustered data management

Inventors: Naresh K. Chainani (Portland, OR); Kiran K. Chinta (Hillsboro, OR); Ian R. Finlay (Uxbridge, CA); David Kalmuk (Markham, CA); Timothy R. Malkemus (Leander, TX); Calisto Zuzarte (Pickering, CA)
Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
G06F16/24544G06F16/2237G06F16/24537
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,036,737
App. No.
16/407,263
Granted
Jun 15, 2021
Kind
B2
Abstract

A computer-implemented method for a partitioned bloom filter merge is provided. A non-limiting example of the computer-implemented method includes partitioning, by a processing device, a bloom filter into N equal size filter partitions. The method further includes distributing, by the processing device, each of the filter partitions to an associated node. The method further includes merging, by the processing device, the filter partitions in each of the associated nodes. The method further includes redistributing, by the processing device, the merged filter partitions to each of the N nodes. The method further includes joining, by the processing device, the merged filter partitions in each of the N nodes to assemble a complete merged bloom filter.

Claims (11)

1. A computer-implemented method comprising:

partitioning, by a processing device, a bloom filter at each node of a plurality of nodes into N equal size filter partitions, wherein N is the number of the plurality of nodes;

distributing, by the processing device, each of the filter partitions among the plurality of nodes such that each node of the plurality of nodes is associated with one of the filter partitions from each of the plurality of nodes;

merging, by the processing device, the filter partitions in each of the plurality of nodes;

redistributing, by the processing device, the merged filter partitions to each of the plurality of nodes; and

joining, by the processing device, the merged filter partitions in each of the plurality of nodes to assemble a complete merged bloom filter.

2. The computer-implemented method of claim 1 , wherein the filter partitions are bitmaps, and wherein merging the filter partitions comprises performing a bitmap merge on the bitmaps.

3. The computer-implemented method of claim 2 , wherein performing the bitmap merge comprises applying an OR operation on the bitmaps.

4. The computer-implemented method of claim 1 , further comprising generating the bloom filter to filter data in a distributed database system prior to partitioning the bloom filter.

5. The computer-implemented method of claim 1 , further comprising filtering the data using the complete merged bloom filter by applying the complete merged bloom filter to a data table to filter rows of data based on the filter.

6. The computer-implemented method of claim 5 , further comprising using the filtered data to perform an operation.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 9, 2019
From: CHAINANI, NARESH K.; CHINTA, KIRAN K.; FINLAY, IAN R.; KALMUK, DAVID; MALKEMUS, TIMOTHY R.; ZUZARTE, CALISTO
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 049129/0679 →
Continuity (2)
Continuation 15790537 · Oct 23, 2017
Related Publication 20190266159A1 · Aug 29, 2019