文献类型：期刊文献

英文题名：Sorting the sequence of the web services by max-heaps

作者：YuXin, Wang[1]; HongYu, Li[2]; Ning, He[1]

第一作者：王郁昕

通讯作者：YuXin, W.

机构：[1] College of Information, Beijing Union University, Beijing 100101, China; [2] Electronic Information Experimental Training Center of Beijing Union University, Beijing 100101, China

第一机构：北京联合大学智慧城市学院

通讯机构：[1]College of Information, Beijing Union University, Beijing 100101, China|[1141734]北京联合大学智慧城市学院;[11417]北京联合大学;

年份：2012

卷号：4

期号：1

起止页码：303-310

外文期刊名：Advances in Information Sciences and Service Sciences

收录：EI(收录号：20120614750484);Scopus(收录号：2-s2.0-84856578620)

语种：英文

外文关键词：Directed graphs - Graph structures - Websites

摘要：An Internet application often deals with many Web services which become premise for achieving the application. The relationship among Web services forms a kind of constraint that reflect the dependency relationships in those services, that is, the implementation of some services depends on the results from other services. In this paper a method is proposed for recording and retrieving the dependency relationships of Web services in UDDI. A directed graph which has adjacency-list data structure is used for representing the dependency relationships and the adjacency-list is built by means of heapsort whose running cost is O(VlgV). Finally, an algorithm for scheduling services is given in accordance with constraints of their dependency relationships.