an efficient schema matcing algorithm

ISCAS OpenIR

	an efficient schema matcing algorithm
	Cheng W; Lin HS; Sun YF
	2005
会议名称	9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	972-978
会议日期	SEP 14-16,
会议地点	Melbourne, AUSTRALIA
收录类别	sci ; istp ; ei
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 2, PROCEEDINGS
ISSN	0302-9743
ISBN	3-540-28895-3
部门归属	Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
摘要	Schema matching, the problem of finding semantic correspondences between elements of source and warehouse schemas, plays a key role in data warehousing. Currently, the mappings are largely determined manually by domain experts, thus a time-con
关键词	Algorithms Data Warehouses Linguistics
语种	英语
WOS记录号	WOS:000232722200134
引用统计	被引频次：1[WOS] [WOS记录] [WOS相关记录]
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12730
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Cheng W,Lin HS,Sun YF. an efficient schema matcing algorithm[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 2, PROCEEDINGS,2005:972-978.