数据关联是Web服务的输入输出数据之间存在的对应关系,它反映了服务与服务在业务逻辑上的相关性,这种相关性信息对于服务组装、服务发现等任务具有重要的意义.已有的数据关联建模方法根据服务接口所使用的数据模型或本体模型进行机器推理间接地表达数据关联,这种表达方式在表达能力上存在局限性.针对这个问题,文中借鉴超级链接的思想,提出了显式数据关联的概念,通过静态声明的方法将数据关联直接表达出来.文中定义了显式数据关联的模型,给出了该模型的XML实现.在此基础上,文中讨论了显式数据关联的应用,并给出了利用显式数据关联优化WS—Challenge 2007组装算法的一个应用案例,实验结果表明,该优化方法在处理具有复杂继承关系的数据集时能够有效提高算法的效率,最终该算法在比赛中夺得组装性能冠军.
Data correlations are relationships among I/O documents of Web services. They reflect the correlations among services on business logics, and are important to service tasks such as service composition, service discovery, and etc. Existing modeling methods of data correlation express data correlations indirectly by reasoning on data models or ontology models used by service interface definitions, and they have limitations on expressiveness. In order to solve this problem, referring to the idea of hyperlinks, this paper proposes the concept of Explicit Data-Link, which expresses data correlations as static explicit declarations. It first gives the abstract model of explicit data-link and its XML implementation. Then, the application of explicit data-link is discussed in detail. A study case that makes use of explicit data-link to optimize the composition algorithm for WS-Challenge 2007 is given. The experiment results show that this optimization method is effective when dealing with data sets that have complex inheritance structures, and the algorithm wins the championship of performance in the competition.