Column Name Weighting for Sparse Data Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Matching data in column-oriented data tables, particularly with sparse and unstructured data sources, is challenging due to the complexity of column names and the need for improved matching techniques.
Innovation Solution
A computer-implemented method that receives a column-oriented table, determines weighting for column names based on frequency and synonyms, and processes it with a probabilistic matching engine to enhance data matching and merging quality.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional data matching methods are used on column-oriented data tables, then processing simplicity is maintained, but matching accuracy deteriorates due to sparse and unstructured data
Solution Approach 1:
The patent transforms column names into weighted numerical representations where each column name is assigned a weight based on its frequency and synonym count. This parameter transformation converts qualitative column name differences into quantitative weighted scores, enabling accurate matching of sparse and unstructured data while maintaining systematic processing through mathematical operations on the weighted parameters
Solution Approach 2:
The patent introduces an intermediary weighting mechanism that bridges the gap between traditional exact matching and probabilistic matching. By computing weights based on column name frequency and synonym relationships, the system creates an intermediate representation that facilitates accurate matching of semantically equivalent column names while filtering out irrelevant variations in sparse and unstructured data
2Manufacturing precision
If column names are weighted based on frequency and synonyms, then data matching quality is improved, but computational complexity increases
Solution Approach 1:
The patent performs preliminary actions by pre-computing column name weights based on frequency analysis and synonym relationships before the actual data matching process. This pre-processing step creates a weighted index structure that enables faster and more accurate matching during execution, reducing the computational burden during the actual merging operation while improving data merging quality
Solution Approach 2:
The patent replaces traditional mechanical string comparison methods with a mathematical weighting system. Instead of directly comparing column names using exact string matching or complex probabilistic algorithms, the system substitutes these with weighted score calculations based on frequency and synonym counts, simplifying the computational process while enhancing matching precision
Data Source
AI summary
A computer-implemented method includes receiving a column-oriented table comprising data for a column family, wherein the data for the column family comprises column names and corresponding column values, receiving a set of anonymous column names for the column family, receiving a set of synonymous column names for the column family, determining a weighting for each column name that is not an anonymous column name based on the count or frequency of occurrence of the column name and the synonymous column names within the column-oriented table, and processing the column-oriented table with a probabilistic matching engine using the weighting for each column name. A corresponding computer program product and computer system are also disclosed herein.


