计算机科学与探索 ›› 2013, Vol. 7 ›› Issue (1): 14-24.DOI: 10.3778/j.issn.1673-9418.1209008

• 学术研究 • 上一篇    下一篇

同质Mashup构件池动态构造机制

赵  星1,2,刘譞哲1,2+,王旭东1,2,黄  罡1,2   

  1. 1. 北京大学 信息科学技术学院,北京 100871
    2. 高可信软件技术教育部重点实验室,北京 100871
  • 出版日期:2013-01-01 发布日期:2012-12-29

A Mechanism for Dynamically Constructing Homogeneous Mashup Components Pool

ZHAO Xing1,2, LIU Xuanzhe1,2+, WANG Xudong1,2, HUANG Gang1,2   

  1. 1. School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China
    2. Key Laboratory of High Confidence Software Technologies, Ministry of Education, Beijing 100871, China
  • Online:2013-01-01 Published:2012-12-29

摘要: 互联网上存在大量“同质”的网站或服务,以其封装而成的Mashup构件往往提供相同或相似的功能,为了获取最佳服务,用户不得不逐一浏览每个Mashup构件,花费大量的时间和精力。从用户视角出发,提出了一种同质Mashup构件动态聚合机制。基于元数据搜索和表单匹配技术,该机制将多个同质Mashup构件组成一个构件池,再按照用户当前的数据请求,动态发现最佳服务,从而实现服务资源的整合和优化,提高整体服务质量。最后,基于富客户端构件组装与验证框架iMashup实现了上述机制,并进行了实验验证。

关键词: Mashup构件, 表单匹配, 元搜索

Abstract: A number of Web resources might provide similar or even same functionalities, but vary from one another in terms of qualities. These Web resources are called “homogeneous” Mashup components. In order to get a best one, users have to fill in the forms of individual Mashup components, and pay a lot of time for viewing each result. From the user’s perspective, this paper puts forward a mechanism for dynamically constructing homogeneous Mashup components pool, which aggregates the homogeneous Mashup components based on metadata search and form matching, and dynamically selects the best service results according to the current data request. In this way, it can optimize component selection and improve the quality of services. Finally, this paper realizes the mechanism based on iMashup (the frame of component assembly and test in rich client) and validates it in experiment.

Key words: Mashup component, form matching, meta-search