CPC G06F 16/2246 (2019.01) [G06F 16/2255 (2019.01); G06F 16/2282 (2019.01); G06F 16/2379 (2019.01)] | 18 Claims |
1. A computer-implemented method (CIM) comprising:
storing a first tree structure including nodes and connections between the nodes with ordered levels from highest to lowest, where each node of the first tree structure corresponds to a respective hash value of a data record in a first version of a database, wherein the nodes are arranged in branches extending from a root node and are respectively assigned to one of the branches based on an updating frequency of a database record associated with a respective one of the nodes;
receiving a first updating frequency value for a first database record of the first version of the database;
determining that the first updating frequency value exceeds a first threshold;
responsive to the determination that the first updating frequency value exceeds the first threshold, updating the first tree structure by moving a first node corresponding to the hash value of the first database record from a first level of the ordered levels to a second level of the ordered levels, with the second level being a higher level of the first tree structure than the first level is; and
traversing the first tree structure when performing a comparison of the hash value corresponding to the first node to determine any discrepancy between the first version of the database with a second tree structure corresponding to a second version of the database.
|