Foreign-key detection using pruning and scoring
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for determining foreign-key relationships between data tables are often resource-intensive and can lead to time delays, especially when performed in real-time, and may result in unsatisfactory user experiences, particularly when these relationships are not declared a priori or are lost during data format changes.
Innovation Solution
The implementation automatically determines foreign-key relationships by obtaining a set of data tables, employing pruning criteria to eliminate unlikely candidate pairs, and using a scoring function to rank potential relationships, thereby reducing resource utilization while maintaining high accuracy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If existing methods are used to determine foreign-key relationships between data tables, then comprehensive detection can be achieved, but resource consumption increases and time delays occur
Solution Approach 1:
The patent segments the foreign-key detection process into distinct phases: candidate pair generation, filtering, and scoring. This segmentation allows the system to process potential foreign-key relationships in manageable stages, reducing overall computational resource consumption while maintaining detection accuracy through systematic evaluation at each stage.
Solution Approach 2:
The patent applies local quality by using a scoring function that evaluates candidate foreign-key pairs based on specific local characteristics such as data type compatibility, null value patterns, and referential integrity constraints. This localized evaluation approach focuses computational resources on promising candidates rather than uniformly processing all possible pairs, thereby reducing resource consumption while preserving detection precision.
2Measurement precision
If existing methods are used to determine foreign-key relationships, then detection can be performed, but time delays occur especially in real-time scenarios
Solution Approach 1:
The patent implements preliminary action by pre-generating candidate foreign-key pairs based on structural characteristics of the data tables before performing comprehensive validation. This preliminary candidate generation step filters out obviously invalid pairs early in the process, reducing the time required for full detection while maintaining accuracy through subsequent scoring and validation stages.
Solution Approach 2:
The patent applies skipping by allowing the detection process to quickly evaluate and discard low-probability candidate pairs using efficient scoring metrics, rather than performing exhaustive validation on all candidates. This rushing through of unlikely candidates significantly reduces detection time while preserving accuracy by focusing detailed analysis only on high-scoring pairs.
3Measurement precision
If manual identification of foreign-key relationships is performed, then accuracy can be maintained, but productivity decreases
Solution Approach 1:
The patent implements self-service by enabling the system to automatically detect and identify foreign-key relationships without requiring manual intervention. The automated detection process uses scoring functions and validation rules to independently evaluate candidate pairs, achieving both high accuracy and improved productivity by eliminating the time-consuming manual identification process while maintaining reliable detection results.
Data Source
AI summary
This patent application relates to foreign-key detection. One implementation obtains a set of data tables. This implementation automatically determines foreign-key relationships of columns from separate tables of the set.