IP Library › Patent Application 19572692
Patent Application
App. No. 19/572,692

DATABASE SYNCHRONIZATION USING RESIZABLE INVERTIBLE BLOOM FILTERS WITH DATABASE SNAPSHOTS

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 None
App. No.
19/572,692
Abstract

A centralized database management system performs data synchronization with lower bandwidth consumption and higher efficiency using a resizable invertible bloom filter. The system may include a resizable invertible bloom filter module that constructs and maintains invertible bloom filters that are resizable based on a number of differences between different snapshots. The resizable invertible bloom filter module may maintain a list of possible sizes for a resizable invertible bloom filter. The resizable invertible bloom filter module may determine and maintain a list of applicable partition sizes, each partition size being a product of a divisor and a resizing factor. If the number of differences exceeds the number of expected differences and results in failure in decoding, the system may retry a larger size in a set of predetermined sizes. The system may continue to try larger sizes until a minimal size required for successful decoding is found.

Claims (40)

1 . A method comprising:

determining a first size for a first resizable invertible bloom filter and a second resizable invertible bloom filter based on an estimation of a number of changes in a source data table that will occur between a first point in time and a second point in time;

determining an actual number of changes in the source data table between the first point in time and the second point in time;

based on the actual number of changes being smaller than the estimated number of changes, updating the first resizable invertible bloom filter and the second resizable invertible bloom filter to have a second size smaller than the first size;

identifying changes in the source data table that occurred between the first point in time and the second point in time based on the updated first resizable invertible bloom filter and the updated second resizable invertible bloom filter; and

sending instructions to a destination data table, the instructions comprising information to perform an operation that synchronizes the destination data table with the source data table based on the identified changes.

2 . The method of claim 1 , wherein the first and second sizes are determined based on mathematical constraints.

3 . The method of claim 1 , wherein the first and second sizes are determined based on a set of prime divisors and a set of resizing factors, and wherein each size is a product of a prime divisor of the set of prime divisors and a resizing factor of the set of resizing factors.

4 . The method of claim 3 , wherein each resizing factor of the set of resizing factors is a prime number.

5 . The method of claim 4 , wherein each prime divisor of the set of prime divisors is multiplied by each resizing factor of the set of resizing factors in descending order.

6 . The method of claim 3 , wherein each prime divisor in the set of prime divisors has a same value, and wherein each prime divisor of the set of prime divisors is multiplied by each resizing factor of the set of resizing factors.

7 . The method of claim 1 , wherein identifying the changes in the source data table further comprises:

generating a third resizable invertible bloom filter by subtracting the updated second resizable invertible bloom filter from the updated first resizable invertible bloom filter, the third resizable invertible bloom filter comprising information associated with a change in the source data table that occurred between the first point in time and the second point in time.

8 . The method of claim 7 , further comprising identifying the changes by decoding the third invertible bloom filter.

9 . A non-transitory computer-readable storage medium storing executable computer instructions that, when executed by one or more processors, cause the one or more processors to perform operations, the instructions comprising instructions to:

determine a first size for a first resizable invertible bloom filter and a second resizable invertible bloom filter based on an estimation of a number of changes in a source data table that will occur between a first point in time and a second point in time;

determine an actual number of changes in the source data table between the first point in time and the second point in time;

based on the actual number of changes being smaller than the estimated number of changes, update the first resizable invertible bloom filter and the second resizable invertible bloom filter to have a second size smaller than the first size;

identify changes in the source data table that occurred between the first point in time and the second point in time based on the updated first resizable invertible bloom filter and the updated second resizable invertible bloom filter; and

send instructions to a destination data table, the instructions comprising information to perform an operation that synchronizes the destination data table with the source data table based on the identified changes.

10 . The non-transitory computer-readable storage medium of claim 9 , wherein the first and second sizes are determined based on mathematical constraints.

11 . The non-transitory computer-readable storage medium of claim 9 , wherein the first and second sizes are determined based on a set of prime divisors and a set of resizing factors, and wherein each size is a product of a prime divisor of the set of prime divisors and a resizing factor of the set of resizing factors.

12 . The non-transitory computer-readable storage medium of claim 11 , wherein each resizing factor of the set of resizing factors is a prime number.

13 . The non-transitory computer-readable storage medium of claim 12 , wherein each prime divisor of the set of prime divisors is multiplied by each resizing factor of the set of resizing factors in descending order.

14 . The non-transitory computer-readable storage medium of claim 11 , wherein each prime divisor in the set of prime divisors has a same value, and wherein each prime divisor of the set of prime divisors is multiplied by each resizing factor of the set of resizing factors.

15 . The non-transitory computer-readable storage medium of claim 9 , wherein identifying the changes in the source data table further comprises:

generating a third resizable invertible bloom filter by subtracting the updated second resizable invertible bloom filter from the updated first resizable invertible bloom filter, the third resizable invertible bloom filter comprising information associated with a change in the source data table that occurred between the first point in time and the second point in time.

16 . The non-transitory computer-readable storage medium of claim 15 , wherein the instructions comprising instructions to identify the changes by decoding the third invertible bloom filter.

17 . A computing system comprising:

a processor; and

a non-transitory computer-readable storage medium storing instructions, the instructions when executed by the processor cause the processor to perform steps including:

determining a first size for a first resizable invertible bloom filter and a second resizable invertible bloom filter based on an estimation of a number of changes in a source data table that will occur between a first point in time and a second point in time;

determining an actual number of changes in the source data table between the first point in time and the second point in time;

based on the actual number of changes being smaller than the estimated number of changes, updating the first resizable invertible bloom filter and the second resizable invertible bloom filter to have a second size smaller than the first size;

identifying changes in the source data table that occurred between the first point in time and the second point in time based on the updated first resizable invertible bloom filter and the updated second resizable invertible bloom filter; and

sending instructions to a destination data table, the instructions comprising information to perform an operation that synchronizes the destination data table with the source data table based on the identified changes.

18 . The system of claim 17 , wherein the first and second sizes are determined based on a set of prime divisors and a set of resizing factors, and wherein each size is a product of a prime divisor of the set of prime divisors and a resizing factor of the set of resizing factors.

19 . The system of claim 17 , wherein identifying the changes in the source data table further comprises:

generating a third resizable invertible bloom filter by subtracting the updated second resizable invertible bloom filter from the updated first resizable invertible bloom filter, the third resizable invertible bloom filter comprising information associated with a change in the source data table that occurred between the first point in time and the second point in time.

20 . The system of claim 19 , wherein the steps further include identifying the changes by decoding the third invertible bloom filter.