Dataset Profiling Tool Dynamic Uniqueness Updates

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional techniques are inadequate for efficiently identifying and updating unique and non-unique column combinations in dynamic datasets, which are common in fields like social networking and scientific measurements, due to their high rate of change and complexity.

Innovation Solution

A dataset profiling tool and method that includes an inserts handler module to identify and group tuples with duplicate values, and a deletes handler module to confirm and update unique and non-unique column combinations using index structures and cache look-ups, allowing for efficient derivation of minimal and maximal uniques and non-uniques.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If conventional techniques are used to identify unique and non-unique column combinations in dynamic datasets, then complete analysis can be achieved, but processing time increases significantly and full dataset scans are required

Engineering Contradiction:
Improveidentification accuracy of unique and non-unique column combinationsVSAvoidprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent pre-computes and stores uniqueness information in data structures (hash sets, position lists) before queries are executed. When identifying unique and non-unique column combinations, the system uses pre-built indexes and cached uniqueness results rather than scanning the entire dataset each time, thereby maintaining high identification accuracy while dramatically reducing processing time.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent extracts only the necessary subset of data for uniqueness analysis by using position lists that store only the positions of duplicate values. Instead of processing the entire dataset, the system extracts and processes only the relevant tuples that contain duplicate values for the column combinations being analyzed, significantly reducing the amount of data that needs to be scanned while maintaining complete analysis accuracy.

Inventive Principle:
Principle #2Taking out (Extraction)

2Measurement precision

If conventional techniques scan the entire dataset to identify unique column combinations, then comprehensive results are obtained, but the complexity of the operation increases

Engineering Contradiction:
Improvecompleteness of unique column combination identificationVSAvoidoperational complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent segments the dataset processing into distinct components: position lists that track duplicate positions for each column, hash sets that store uniqueness information for column combinations, and modular handler modules (inserts handler, deletes handler) that process different operations separately. This segmentation allows the system to maintain comprehensive identification capabilities while reducing operational complexity through modular, reusable components.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces intermediary data structures (position lists, hash sets, and uniqueness information tables) that mediate between the raw dataset and the uniqueness analysis operations. These intermediaries pre-organize data in ways that make uniqueness determination straightforward, reducing the complexity of the analysis operations while ensuring comprehensive results through the structured intermediate representations.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Adaptability or versatility

If the dataset is updated frequently with insertions and deletions, then the data remains dynamic and current, but maintaining unique and non-unique column combination information becomes more difficult

Engineering Contradiction:
Improvedynamic data update capabilityVSAvoidmaintenance complexity of uniqueness information
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent implements self-service mechanisms where the data structures automatically maintain uniqueness information during insertions and deletions. The inserts handler module automatically updates position lists and hash sets when new tuples are added, and the deletes handler module automatically adjusts uniqueness information when tuples are removed. This automated self-maintenance reduces the complexity of managing dynamic datasets while preserving full adaptability to frequent updates.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The patent employs feedback mechanisms where the uniqueness information stored in hash sets and position lists provides immediate feedback about the state of duplicate values. When insertions or deletions occur, the system uses this feedback to efficiently determine whether uniqueness status changes are needed, allowing dynamic data maintenance with reduced complexity through informed, feedback-driven updates rather than exhaustive re-analysis.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS10318388B2Datasets profiling tools, methods, and systems
Publication Date: 2019.06.11 HAMAD BIN KHALIFA UNIVERSITY
  • US10318388B2 patent drawing
  • US10318388B2 patent drawing

AI summary

A dataset profiling tool configured to identify unique and non-unique column combinations in a dataset which includes a plurality of tuples, the tool including: an inserts handler module configured to: receive one or more new tuples for insertion into the dataset, receive one or more minimal uniques and one or more maximal non-uniques for the dataset, identify and group, for each minimal unique, any tuples of the dataset and any of the one or more new tuples which contain duplicate values in the column combinations of the minimal unique, to form grouped tuples which are grouped according to the minimal unique to which the tuples relate, validate the grouped tuples to identify supersets of the minimal uniques for which duplicate values were identified, to generate a new set of one or more minimal uniques and one or more maximal non-uniques, and output the new set of one or more updated minimal uniques and one or more maximal non-uniques.