Query Result Deduplicator Using Unique Duplicate Set Identifiers

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Enterprise content management systems face inefficiencies due to the high probability of duplicate data objects across heterogeneous repositories, leading to wasted time and resources in search queries, as existing hash functions fail to accurately identify and manage duplicates effectively.

Innovation Solution

A system that assigns unique duplicate set identifiers to data objects, allowing the query result deduplicator tool to identify and output only the unique master copy of duplicate sets, eliminating the need for recalculating hash values upon data additions or deletions, thereby saving time and resources.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If hash functions are used to identify duplicate data objects across heterogeneous repositories, then duplicate detection capability is improved, but system complexity and processing overhead increase due to recalculating hash values upon data changes

Engineering Contradiction:
Improveduplicate detection accuracyVSAvoidsystem complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The system pre-calculates and stores hash values for all data objects in a centralized cache before queries are executed. This preliminary action eliminates the need to recalculate hash values during query processing or upon data changes, reducing system complexity while maintaining duplicate detection accuracy. The hash cache is maintained and updated efficiently without requiring full recalculations.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

Instead of recalculating hash values from original data objects during queries, the system creates and stores copies of hash values in a centralized cache. This copying approach allows rapid duplicate detection during queries without accessing or processing the original data objects, reducing processing overhead and system complexity.

Inventive Principle:
Principle #26Copying

2Reliability

If duplicate data objects are retrieved and processed, then complete search results are provided, but time and resources are wasted on duplicate objects

Engineering Contradiction:
Improvesearch result completenessVSAvoidquery processing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system extracts duplicate data objects from query results by comparing stored hash values against each other during query processing. By identifying and removing duplicates through hash comparison, the system provides complete search results while eliminating time-wasting duplicate retrievals and processing.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The hash cache serves as an intermediary mechanism that enables duplicate detection during query processing. By introducing this intermediate hash comparison step, the system can identify and filter duplicates without accessing the actual data objects, saving time while ensuring complete and accurate search results.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Measurement precision

If hash values are recalculated upon data additions or deletions, then duplicate set accuracy is maintained, but processing time and computational resources increase

Engineering Contradiction:
Improveduplicate set accuracyVSAvoidquery processing efficiency
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The system performs preliminary hash calculations and stores results in a cache before they are needed for query processing. This allows the system to maintain duplicate set accuracy without recalculating hash values during queries or data changes, preserving productivity while ensuring measurement precision.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The hash cache automatically maintains itself through efficient update mechanisms when data is added or deleted, without requiring full recalculations. The system serves its own duplicate detection needs through the pre-stored hash values, maintaining accuracy while preserving query processing efficiency.

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS10055422B1De-duplicating results of queries of multiple data repositories
Publication Date: 2018.08.21 DELL EMC
  • US10055422B1 patent drawing
  • US10055422B1 patent drawing
  • US10055422B1 patent drawing

AI summary

De-duplicating results of queries of data repositories is described. A system associates each data object of the first set of duplicate data objects stored by multiple data repositories with a first unique duplicate set identifier, and each data object of the second set of duplicate data objects stored by the multiple data repositories with a second unique duplicate set identifier. The system identifies a first data object of the first set of duplicate data objects and a second data object of the first set of duplicate data objects in response to a query. The system determines that the first data object is associated with the first unique duplicate set identifier, and that the second data object is also associated with the first unique duplicate set identifier. The system outputs a query result that includes only the first data object.