Predicting Service Mashup Candidates Using Enhanced Syntactical Message Management

被引:7
作者
Blake, M. Brian [1 ]
Nowlan, Michael F. [1 ]
机构
[1] Georgetown Univ, Dept Comp Sci, Washington, DC 20057 USA
来源
2008 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING, PROCEEDINGS, VOL 1 | 2008年
关键词
Web services; service mashup; service-oriented computing;
D O I
10.1109/SCC.2008.68
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The descriptiveness of capabilities advertised on service-oriented architectures provides a promising platform for crafting new knowledge. Service mashup has been introduced as an approach for integrating the information provided from multiple web services into one common operational picture. In the future, scale will be a barrier to these types of approaches. With the entry and exit of large numbers of services on the Internet, it will be difficult to find and suggest the most relevant service candidates for new mashups. In this work, we present an efficient syntactical approach for actively discovering web service candidates for service mashups. This approach leverages the message naming characteristics of the developers and of the target service repository to inform search algorithms. Favorable precision results are described based on experimentation executed on an open repository of web service from the Internet.
引用
收藏
页码:229 / 236
页数:8
相关论文
共 28 条
[1]  
BENATALLAH B, 2005, DISTRIBUTED PARALLEL, V15, P5
[2]  
BLAKE MB, 2005, P IEEE INT C E TECHN
[3]  
BLAKE MB, IEEE INTERN IN PRESS
[4]  
BLAKE MB, 2007, INT T SYSTEMS SCI AP, V3
[5]  
BLAKE MB, 2007, INT C WEB SERV ICWS
[6]  
Bosca A, 2005, 2005 IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, VOLS 1 AND 2, PROCEEDINGS, P817
[7]  
CETIN S, 2007, IEEE INT C PERV SERV
[8]  
Dong Xin., 2004, Similarity search for web services
[9]   Using origin analysis to detect merging and splitting of source code entities [J].
Godfrey, MW ;
Zou, LJ .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2005, 31 (02) :166-181
[10]  
Jhingran A., 2006, P 32 INT C VER LARG