基于Internet的Web Services收集方法

计算机科学与探索 ›› 2011, Vol. 5 ›› Issue (11): 976-986.

基于Internet的Web Services收集方法

王立杰, 邹艳珍, 金靖, 赵俊峰, 谢冰

1. 高可信软件技术教育部重点实验室, 北京 100871
2. 北京大学信息科学技术学院, 北京 100871

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-11-01 发布日期:2011-11-01

Web Services Harvesting Approach Based on Internet

WANG Lijie, ZOU Yanzhen, JIN Jing, ZHAO Junfeng, XIE Bing

1. Key Laboratory of High Confidence Software Technologies, Ministry of Education, Beijing 100871, China
2. School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China

Received:1900-01-01 Revised:1900-01-01 Online:2011-11-01 Published:2011-11-01

摘要/Abstract

摘要： Web Services作为一种部署在Internet上的新型的可复用软件资源, 得到广泛的重视和应用。但是,现有通用搜索引擎并不能很好地支持Web Services的发现, 这使得软件开发人员需要花费很大的代价寻找合适的Web Services。鉴于此, 提出了一种基于Internet的Web Services获取方法, 采用通用搜索引擎和特定Web Services信息发布网站相结合的方法, 从Internet上收集Web Services, 并从Web Services的相关网页中抽取相关描述信息。利用收集到的Web Services数据, 对当前互联网上的Web Services现状进行了统计分析。这些统计结果一定程度上反映了Web Services的发展现状。

关键词: 资源库, 软件资源收集, Web Services

Abstract: As a special kind of reusable software resources on the Internet, Web Services have received great attention. However, general Web search engine cannot well support the discovery of Web Services, which makes developers have to spend a lot of efforts in order to acquire their desired Web Services. For this reason, this paper proposes an approach for harvesting Web Services from the Internet by leveraging general search engine and specific Web services portals. In addition, it also proposes an approach to extract descriptions for Web Services from their related Web pages on the Internet. Based on the harvested data, it conducts a statistics analysis on the status of Web Services on the Internet.

Key words: resource repository, software resource harvesting, Web Services

王立杰, 邹艳珍, 金靖, 赵俊峰, 谢冰. 基于Internet的Web Services收集方法[J]. 计算机科学与探索, 2011, 5(11): 976-986.

WANG Lijie, ZOU Yanzhen, JIN Jing, ZHAO Junfeng, XIE Bing. Web Services Harvesting Approach Based on Internet[J]. Journal of Frontiers of Computer Science and Technology, 2011, 5(11): 976-986.