About the journal

• Home page
• Contact information
• Aims and scope
• Indexing information
• Editorial policies
• ComSIS consortium
• Journal boards
• Managing board

For authors

• Information for contributors
• Paper submission
• Article submission through OJS
• Copyright transfer form
• Download section

For readers

• Forthcoming articles
• Current issue
• Archive

For reviewers

• View and review submissions

News

• Journal's Facebook page
• Calls for special issues
• New issue notification

Exploring Instances for Matching Heterogeneous Database Schemas Utilizing Google Similarity and Regular Expression

Osama A. Mehdi¹, Hamidah Ibrahim², Lilly Suriani Affendey², Eric Pardede¹ and Jinli Cao¹

1. La Trobe University, Computer Science and Information Technology, Bundoora
   Victoria 3086, Melbourne, Australia
   18729078@students.latrobe.edu.au
2. University Putra Malaysia, Computer Science and Information Technology, Jalan Upm
   43400 Serdang, Selangor, Malaysia
   {hamidah.ibrahim,lilly}@upm.edu.my

Abstract

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.

Key words

schema matching, instance based schema matching, Google similarity, regular expression

Digital Object Identifier (DOI)

https://doi.org/10.2298/CSIS170525002M

Publication information

Volume 15, Issue 2 (June 2018)
Year of Publication: 2018
ISSN: 2406-1018 (Online)
Publisher: ComSIS Consortium

Full text

Available in PDF
Portable Document Format

How to cite

Mehdi, O. A., Ibrahim, H., Affendey, L. S., Pardede, E., Cao, J.: Exploring Instances for Matching Heterogeneous Database Schemas Utilizing Google Similarity and Regular Expression. Computer Science and Information Systems, Vol. 15, No. 2. (2018), https://doi.org/10.2298/CSIS170525002M