Keyword-driven automatic combination method of Web services
The invention discloses a keyword-driven automatic combination method of Web services. According to the method proposed by the invention, two important factors of a user are comprehensively considered, that is, personalized function requirements and the number of services. In view of the problem of...
Saved in:
Main Authors | , , , , |
---|---|
Format | Patent |
Language | Chinese English |
Published |
26.04.2019
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The invention discloses a keyword-driven automatic combination method of Web services. According to the method proposed by the invention, two important factors of a user are comprehensively considered, that is, personalized function requirements and the number of services. In view of the problem of automatic Web service combination with the minimum number of combined services under the double constraint of keyword uniqueness and keyword timing, the keyword-driven automatic combination method of Web services is proposed. In particular, a series of efficient pruning strategies is achieved by constructing three indexes in the method. In order to achieve efficient query processing, the invention further proposes a series of graph optimization strategies.
本发明公开了一种关键字驱动的Web服务自动组合方法,本发明提出的方法综合考虑了用户的个性化功能需求和服务数量两个重要因素。针对关键字唯一性和关键字时序性双重约束下组合服务个数最小化的自动Web服务组合问题,提出了关键字驱动的Web服务自动组合方法。特别地,该方法通过构造三个索引来实现了一系列有效的剪枝策略。为了实现高效的查询处理,本发明还提出了一系列图优化策略。 |
---|---|
Bibliography: | Application Number: CN201910003351 |