中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
web service schema matching based on invocation instance duplicates
Author: Wang Ke ; Ou Wei-Jie ; Zeng Cheng ; Li De-Yi ; Peng Zhi-Yong
Source: Proceedings of the 2011 7th International Conference on Next Generation Web Services Practices, NWeSP 2011
Conference Name: 2011 7th International Conference on Next Generation Web Services Practices, NWeSP 2011
Conference Date: October 19, 2011 - October 21, 2011
Issued Date: 2011
Conference Place: Salamanca, Spain
Keyword: Quality of service ; Semantic Web ; Semantics
Indexed Type: EI
ISBN: 9781457711268
Department: (1) National Science Library Chinese Academy of Sciences Beijing 100190 China; (2) State Key Lab of Software Engineering Wuhan University Wuhan 430072 China; (3) China Institute of Electronic System Engineering Beijing 100840 China; (4) School of Computer Wuhan University Wuhan 430072 China
Sponsorship: Machine Intelligence Research Labs (MIR Labs)
Abstract: Web service schema matching is the preliminary phase of service composition and service Mashup. With the entry of large numbers of services on the Internet, it will be difficult to find and suggest the most relevant service candidates for new composition and Mashup. Furthermore, the composition and Mashup candidates must be confirmed by manual work which is very inefficient and even inefficacious. In this work, we present an approach for web service schema matching based on service invocation instance duplicates. This approach predicts the schema relationship between web service parameters based on duplicates among invocation data sets and is very different from the syntactical-based and semantic-based matching approaches. It can be used for predicting and verifying service composition and Mashup candidates. © 2011 IEEE.
English Abstract: Web service schema matching is the preliminary phase of service composition and service Mashup. With the entry of large numbers of services on the Internet, it will be difficult to find and suggest the most relevant service candidates for new composition and Mashup. Furthermore, the composition and Mashup candidates must be confirmed by manual work which is very inefficient and even inefficacious. In this work, we present an approach for web service schema matching based on service invocation instance duplicates. This approach predicts the schema relationship between web service parameters based on duplicates among invocation data sets and is very different from the syntactical-based and semantic-based matching approaches. It can be used for predicting and verifying service composition and Mashup candidates. © 2011 IEEE.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/16313
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Wang Ke,Ou Wei-Jie,Zeng Cheng,et al. web service schema matching based on invocation instance duplicates[C]. 见:2011 7th International Conference on Next Generation Web Services Practices, NWeSP 2011. Salamanca, Spain. October 19, 2011 - October 21, 2011.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Wang Ke]'s Articles
[Ou Wei-Jie]'s Articles
[Zeng Cheng]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Wang Ke]‘s Articles
[Ou Wei-Jie]‘s Articles
[Zeng Cheng]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

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

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace