ISCAS OpenIR
an efficient schema matcing algorithm
Cheng W; Lin HS; Sun YF
2005
Conference Name9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems
SourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages972-978
Conference DateSEP 14-16,
Conference PlaceMelbourne, AUSTRALIA
Indexed Typesci ; istp ; ei
Publish PlaceHEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
PublisherKNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 2, PROCEEDINGS
ISSN0302-9743
ISBN3-540-28895-3
DepartmentChinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
English AbstractSchema 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
KeywordAlgorithms Data Warehouses Linguistics
Language英语
WOS IDWOS:000232722200134
Citation statistics
Cited Times:1[WOS]   [WOS Record]     [Related Records in WOS]
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/12730
Collection中国科学院软件研究所
Recommended Citation
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.
Files in This Item:
File Name/Size DocType Version Access License
an efficient schema (270KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Cheng W]'s Articles
[Lin HS]'s Articles
[Sun YF]'s Articles
Baidu academic
Similar articles in Baidu academic
[Cheng W]'s Articles
[Lin HS]'s Articles
[Sun YF]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Cheng W]'s Articles
[Lin HS]'s Articles
[Sun YF]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.