Duplicate Elimination

From Algorithm Wiki
Revision as of 13:48, 15 September 2021 by Yashsherry (talk | contribs) (→‎Problem Description)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Problem Description

SQL does not eliminate duplicates implicitly. It allows to enter duplicate values on columns other than candidate key or if did not specified any keys. If the user wants to eliminate duplicate records, he has to use DISTINCT keyword in the query.

Databases, therefore, can have duplicate entries. The problem deals with identifying and removing duplicates from a database.

Bounds Chart

Duplicate EliminationBoundsChart.png

Step Chart

Duplicate EliminationStepChart.png

Improvement Table

Complexity Classes Algorithm Paper Links Lower Bounds Paper Links
Polynomial > 3
Quadratic [ Priority Queue Algorithm (1976)]
nlogn [Sorting based [Merge Sort] (1964)]

[Sorting based [Merge Sort] + real-time elimination (1964)]

[BST Algorithm (1999)]

[sorted neighborhood algorithm (1993)] [Duplicate elimination sorted neighborhood algorithm (DE-SNA) (2002)]

adaptive duplicate detection algorithm (ADD) (2003)