• Mayuri Jadhav
• Komal Bidkar
• Punam Jiwane
• Prachi Ghorpade
• Prof. K.S.Warke

To carry out operations many of the industries depend on the accuracy of databases. Independent expansion of substructure leads to the generation of duplicates. Eliminating these duplicates not only incurs generation and storage cost but also additional computation for its elimination. Our primary aim is to design techniques to reduce generating duplicate substructures using graph mining concept. We set up theoretical correctness of each method as well as its analysis with respect to graph characteristics such as degree, number of unique labels, and label distribution. We also examine the applicability of their combination for improvements in duplicate reduction. Finally, we discuss the effects of the limitations with respect to the partitioning schemes used in graph mining. Our experiments demonstrate significant benefits of these constraints in terms of storage, computation, and communication cost across graphs with varied characteristics.

"Duplication Reduction Using Map Reduce Technique ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 5, page no.683-687, May-2019, Available :http://www.jetir.org/papers/JETIR1905C99.pdf

"Duplication Reduction Using Map Reduce Technique ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 5, page no. pp683-687, May-2019, Available at : http://www.jetir.org/papers/JETIR1905C99.pdf