Identifying transaction data having overlapping data points using nodal data structures

1 . A method for deduplicating data records and creating efficiencies for data queries using a nodal graph data structure, to improve computer functioning by conserving memory and compute resources and avoiding computationally intensive redundant calculations, the method comprising executing, by one or more processors, operations comprising:

generating, the nodal graph data structure comprising a set of nodes where each node represents an aggregation of network operation data associated with network operations, wherein the nodal graph data structure is configured to prevent double-counting of network operations by ensuring each network operation is allocated to only one network operation data aggregation group within the nodal graph data structure;

executing a union-find algorithm to detect, in the nodal graph data structure, first instances of network operations being associated with a first subset of the set of nodes and second instances of the network operations being associated with the first subset and a second subset of the set of nodes;

responsive to detecting, in the nodal graph data structure, the first instances of the network operations and the second instances of the network operations:

forming a network operation data aggregation group comprising the first subset of the set of nodes and the second subset of the set of nodes by adding, in the nodal graph data structure, an edge connecting the first subset of the set of nodes and the second subset of the set of nodes, wherein adding the edge allows the processor to efficiently retrieve data without moving or retrieving underlying network operation data;

disassociating, the first instances of the network operations with the first subset of the set of nodes to prevent duplicated instances of the network operations in query responses and to prevent double-counting of the network operation in the nodal graph data structure; and

storing an aggregate ratio of values for the network operation data aggregation group to be used; and

responsive to receiving a query request to identify a ratio of values for a network operation of the network operations:

generating a response to the query request by traversing the nodal graph data structure to identify the network operation data aggregation group, wherein tracking data associated with the network operation data aggregation group in the nodal graph data structure requires less computing power than tracking the first set of network operation data and the second set of network operation data as raw data; and

applying the aggregate ratio of values for the network operation data aggregation group to the network operation, wherein calculating the ratio of values based on the nodal graph data structure conserves memory and compute resources compared to calculating the ratio of values based on the underlying first set of network operation data and second set of network operation data, and wherein the nodal graph data structure prevents redundant calculations that would otherwise be required for each aggregation of network operation data.

2 . The method of claim 1 , wherein the network operation data includes an indication of a split of network values between two or more entities.

3 . The method of claim 1 , further comprising generating additional data based on the first instances of network operations being associated with the first subset of the set of nodes.

4 . The method of claim 3 , further comprising modifying the additional data based on the first instances of network operations being associated with the first subset of the set of nodes and the second subset of the set of nodes.

5 . The method of claim 4 , wherein modifying the additional data comprises reversing at least one calculation performed in generating the additional data.

6 . The method of claim 3 , wherein the additional data includes a mapping of an amount of the first instances of the network operations to the first subset of the set of nodes.

7 . The method of claim 6 , wherein disassociating, the first instances of the network operations with the first subset of the set of nodes includes deleting the mapping of the amount of the first instances of network operations to the first subset of the set of nodes.

8 . The method of claim 1 , further comprising mapping an amount of the first instances of the network operations to the first and second subsets of the set of nodes.

9 . A system comprising one or more processors and a non-transitory, computer readable medium comprising instructions which, when executed by the one or more processors, cause the one or more processors to:

generate a nodal graph data structure comprising a set of nodes where each node represents an aggregation of network operation data associated with network operations, wherein the nodal graph data structure is configured to prevent double-counting of network operations by ensuring each network operation is allocated to only one network operation data aggregation group within the nodal graph data structure;

detect, in the nodal graph data structure, first instances of network operations being associated with a first subset of the set of nodes and second instances of the network operations being associated with the first subset and a second subset of the set of nodes:

responsive to detecting, in the nodal graph data structure, the first instances of the network operations and the second instances of the network operations:

form a network operation data aggregation group comprising the first subset of the set of nodes and the second subset of the set of nodes by adding, in the nodal graph data structure, an edge connecting the first subset of the set of nodes and the second subset of the set of nodes, wherein adding the edge allows the processor to efficiently retrieve data without moving or retrieving underlying network operation data;

disassociate the first instances of the network operations with the first subset of the set of nodes to prevent duplicated instances of the network operations in query responses and to prevent double-counting of the network operation in the nodal graph data structure; and

store an aggregate ratio of values for the network operation data aggregation group to be used; and

responsive to receiving a query request to identify a ratio of values for a network operation of the network operations:

generate a response to the query request by traversing the nodal graph data structure to identify the network operation data aggregation group and applying the aggregate ratio of values for the network operation data aggregation group to the network operation, wherein tracking data associated with the network operation data aggregation group in the nodal graph data structure requires less computing power than tracking the first set of network operation data and the second set of network operation data as raw data.

10 . The system of claim 9 , wherein the network operation data includes an indication of a split of network values between two or more entities.

11 . The system of claim 9 , wherein the instructions further cause the one or more processors to generate additional data based on the first instances of network operations being associated with the first subset of the set of nodes.

12 . The system of claim 11 , wherein the instructions further cause the one or more processors to modify the additional data based on the first instances of network operations being associated with the first subset of the set of nodes and the second subset of the set of nodes.

13 . The system of claim 12 , wherein the instructions cause the one or more processors to modify the additional data by reversing at least one calculation performed in generating the additional data.

14 . The system of claim 11 , wherein the additional data includes a mapping of an amount of the first instances of the network operations to the first subset of the set of nodes.

15 . The system of claim 14 , wherein the instructions cause the one or more processors to disassociate the first instances of network operations with the first subset of the set of nodes by deleting the mapping of the amount of the first instances of network operations to the first subset of the set of nodes.

16 . The system of claim 9 , wherein the instructions cause the one or more processors to map an amount of the first instances of network operations to the first and second subsets of the set of nodes.