Date of Publication :17th August 2017

Abstract: Database contains very large data sets, where various duplicate records are present. The duplicate records occur when data entries are stored in a uniform manner in the database, resolving the structural heterogeneity problem. Maximum the gain of the overall process within time availability by reporting most results much earlier than traditional approaches. Detection of duplicate records is difficult to find and it takes more execution time. The authors described various techniques used to find duplicate records in the database but there are some issues in these techniques. To address this, Progressive Algorithms have been said, for that, which significantly increases the efficiency of finding duplicates, if the execution time is limited and improves the quality of records. The authors will combine base paper progressive approaches with scalable approaches for duplicate detection to deliver results even faster

Reference :