Exploring instances for matching heterogeneous database schemas utilizing Google similarity and regular expression

• Main Authors: Mehdi, Osama A., Ibrahim, Hamidah, Affendey, Lilly Suriani, Pardede, Eric, Cao, Jinli
• Format: Article
• Language: English
• Published: ComSIS Consortium 2018
• Online Access: http://psasir.upm.edu.my/id/eprint/72675/1/Exploring%20instances%20for%20matching%20heterogeneous%20database%20schemas%20utilizing%20Google%20similarity%20and%20regular%20expression.pdf; http://psasir.upm.edu.my/id/eprint/72675/; http://www.comsis.org/archive.php?show=ppr633-1705
• Institution: Universiti Putra Malaysia

Instance based schema matching aims to identify correspondences between different schema attributes. Several approaches have been proposed to discover these correspondences in which instances including those with numeric values are treated as strings. This prevents discovering common patterns or performing statistical computation between numeric instances. Consequently, this causes unidentified matches for numeric instances which further effect the results. In this paper, we propose an approach for addressing the problem of finding matches between schemas of semantically and syntactically related attributes. Since we only fully exploit the instances of the schemas, we rely on strategies that combine the strength of Google as a web semantic and regular expression as pattern recognition. To demonstrate the accuracy of our approach, we have conducted an experimental evaluation using real world datasets. The results show that our approach is able to find 1-1 matches with high accuracy in the range of 93% - 99%. Furthermore, our proposed approach outperformed the previous approaches using a sample of instances.