TY - GEN
T1 - Top-K generation of mediated schemas over multiple data sources
AU - Ding, Guohui
AU - Wang, Guoren
AU - Wang, Bin
PY - 2010
Y1 - 2010
N2 - Schema integration has been widely used in many database applications, such as Data Warehousing, Life Science and Ontology Merging. Though schema integration has been intensively studied in recent yeas, it is still a challenging issue, because it is almost impossible to find the perfect target schema. An automatic method to schema integration, which explores multiple possible integrated schemas over a set of source schemas from the same domain, is proposed in this paper. Firstly, the concept graph is introduced to represent the source schemas at a higher-level of abstraction. Secondly, we divide the similarity between concepts into intervals to generate three merging strategies for schemas. Finally, we design a novel top-k ranking algorithm for the automatic generation of the best candidate mediated schemas. The key component of our algorithm is the pruning technique which uses the ordered buffer and the threshold to filter out the candidates. The extensive experimental studies show that our algorithm is effective and runs in polynomial time.
AB - Schema integration has been widely used in many database applications, such as Data Warehousing, Life Science and Ontology Merging. Though schema integration has been intensively studied in recent yeas, it is still a challenging issue, because it is almost impossible to find the perfect target schema. An automatic method to schema integration, which explores multiple possible integrated schemas over a set of source schemas from the same domain, is proposed in this paper. Firstly, the concept graph is introduced to represent the source schemas at a higher-level of abstraction. Secondly, we divide the similarity between concepts into intervals to generate three merging strategies for schemas. Finally, we design a novel top-k ranking algorithm for the automatic generation of the best candidate mediated schemas. The key component of our algorithm is the pruning technique which uses the ordered buffer and the threshold to filter out the candidates. The extensive experimental studies show that our algorithm is effective and runs in polynomial time.
UR - http://www.scopus.com/inward/record.url?scp=77956141181&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-14589-6_15
DO - 10.1007/978-3-642-14589-6_15
M3 - Conference contribution
AN - SCOPUS:77956141181
SN - 3642145884
SN - 9783642145889
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 143
EP - 155
BT - Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, International Workshops
T2 - 15th International Conference on Database Systems for Advanced Applications, DASFAA 2010
Y2 - 1 April 2010 through 4 April 2010
ER -