Partitioned Record Relationship Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current identity resolution technologies using relationship graphs are inefficient and costly due to the time-consuming parsing process, especially when dealing with a large number of nodes.
Innovation Solution
The system partitions records into multiple groups and processes them in parallel using input and output queues, allowing for concurrent access to relationship information in the graph model to determine associations between records.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a relationship graph with a large number of nodes is used to represent identities and relationships, then the completeness of relationship tracking is improved, but the parsing process becomes very time consuming and costly
Solution Approach 1:
The patent partitions the relationship graph into multiple sub-graphs or components, allowing the parsing process to be divided into smaller, parallelizable tasks. Each sub-graph can be processed independently, reducing the overall parsing time while maintaining complete relationship tracking across all partitions.
Solution Approach 2:
The patent performs preliminary indexing and preprocessing of the relationship graph data before the actual parsing operation. This includes creating efficient data structures and organizing the graph data in advance, so that the main parsing process can proceed more quickly without sacrificing relationship tracking completeness.
2Measurement precision
If identity resolution technologies process large numbers of records in a relationship graph, then the accuracy of relationship identification is improved, but the processing cost and time consumption increase significantly
Solution Approach 1:
The patent divides the large set of records into multiple partitions or batches, processing them in parallel while maintaining the ability to identify relationships across partition boundaries. This segmentation allows accurate relationship identification to be achieved without processing the entire dataset sequentially, thus improving productivity.
Solution Approach 2:
The patent introduces intermediary data structures and indexing mechanisms that facilitate efficient relationship queries across partitioned records. These intermediaries enable accurate relationship identification by providing optimized access paths without requiring exhaustive processing of all records.
Data Source
AI summary
Systems and methods are provided for accessing a database of records to identify a set of records represented by one or more nodes in a graph model. A connection between a first node and a second node in the one or more nodes is monitored to determine an association between a first record, represented by the first node, and a second record, represented by the second node. The set of records may be partitioned into a plurality of groups. For at least a first group, including a first set of records, it may be determined whether two or more records in the first group are related. In response to determining that the two or more records in the first group are related, a first group identifier may be assigned to the two or more records.