An Adaptive Multiple Databases for Rough Set Based Record Deduplication
Ravikanth M1, D. Vasumathi2

1Ravikanth M, Research Department of Computer Science and Engineering, CMR Technical Campus, Medchal, Hyderabad, T. S, India.

2D.Vasumathi, Department of Computer Science and Engineering, JNTUH, Hyderabad, T. S, India.

Manuscript received on 20 August 2019 | Revised Manuscript received on 27 August 2019 | Manuscript Published on 31 August 2019 | PP: 559-567 | Volume-8 Issue-9S2 August 2019 | Retrieval Number: I11170789S219/19©BEIESP DOI: 10.35940/ijitee.I1117.0789S219

Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (

Abstract: Theoretical. Records duplication is the circumstance wherein unequivocal record is accessible with it’s constantly number of copies in the database. To see the records that address a close guaranteed substance, record planning methodology is associated. Today, this is the most signi cant and testing task. The closeness of duplicates in the database will absurdly realize more querry dealing with time and solicitation of extra control resources, etc. To avoid these issues and results, records deduplication strategy is performed. In this paper, a Rough set based instrument is proposed which e ciently plays out the records planning strategy. These datasets are set up through our records deduplication handling model. Close to the end, algo-rithm produces the dataset gathering, contains exceptional record sections. A short time later, in this paper, investigate results are shown, which are per-formed for standard datasets and execution is poor down

Keywords: Duplicate Detection, Record Linkage, Data Deduplication, Data in-Tegration, Records Matching, Rough sets
Scope of the Article: Computer Science and Its Applications