an algebraic framework for schema matching
文献类型:期刊论文
作者 | Zhang Zhi ; Shi Pengfei ; Che Haoyang ; Gu Jun |
刊名 | INFORMATICA
![]() |
出版日期 | 2008 |
卷号 | 19期号:3页码:421-446 |
关键词 | schema matching schema homomorphism schema isomorphism graph homomorphism labeled graph matching computation complexity |
ISSN号 | 0868-4952 |
学科主题 | Computer Science, Information Systems; Mathematics, Applied |
收录类别 | SCI |
语种 | 英语 |
公开日期 | 2011-06-10 |
附注 | It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms. An algebraic framework for schema matching is developed in thi |
源URL | [http://124.16.136.157/handle/311060/10329] ![]() |
专题 | 软件研究所_软件所图书馆_期刊论文 |
推荐引用方式 GB/T 7714 | Zhang Zhi,Shi Pengfei,Che Haoyang,et al. an algebraic framework for schema matching[J]. INFORMATICA,2008,19(3):421-446. |
APA | Zhang Zhi,Shi Pengfei,Che Haoyang,&Gu Jun.(2008).an algebraic framework for schema matching.INFORMATICA,19(3),421-446. |
MLA | Zhang Zhi,et al."an algebraic framework for schema matching".INFORMATICA 19.3(2008):421-446. |
入库方式: OAI收割
来源:软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。