Modern graph database management systems use graph structures for semantic queries with nodes, edges, and properties to connect to and store information. Due to their schema-less nature, inappropriate data migration and manipulation can lead to severe data loss during the data query process. Data migration in graph databases strongly depends on graph matching methods to detect similar entities. This article describes a graph matching mechanism based on similarity measures to efficiently migrate data and avoid data loss within the different entities of the graph database.