Matching schemas of heterogeneous relational databases
Schema matching is a basic problem in many database application domains, such as data integration. The problem of schema matching can be formulated as follows, "given two schemas, Si and Sj, find the most plausible correspondences between the elements of Si and S j, exploiting all available inf...
Saved in:
Main Authors: | Karasneh, Yaser Mohammad Ali, Ibrahim, Hamidah, Othman, Mohamed, Yaakob, Razali |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
IEEE
2009
|
Online Access: | http://psasir.upm.edu.my/id/eprint/47992/1/Matching%20schemas%20of%20heterogeneous%20relational%20databases.pdf http://psasir.upm.edu.my/id/eprint/47992/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An automatic domain independent schema matching in integrating schemas of heterogeneous relational databases
by: Ibrahim, Hamidah, et al.
Published: (2014) -
An approach for matching relational database schemas
by: Karasneh, Yaser Mohammad
Published: (2011) -
An approach for matching schemes of heterogeneous relational databases.
by: Karasneh, Yaser, et al.
Published: (2010) -
Exploring instances for matching heterogeneous database schemas utilizing Google similarity and regular expression
by: Mehdi, Osama A., et al.
Published: (2018) -
A Survey of schema matching research using database schemas and instances
by: Aljuboori, Ali Alwan, et al.
Published: (2017)