Efficient Keyword Search for Building Service-Based Systems Based on Dynamic Programming

The advances in service-oriented architecture (SOA) have fueled the demand for building service-based systems (SBSs) by composing existing services. Finding appropriate component services is a key step during the process for building SBSs. However, existing approaches require that system engineers have detailed knowledge of SOA techniques, which is often too demanding. A recent approach has been proposed to address this issue. However, it suffers from poor efficiency, which is increasingly critical as the service repository continues to grow. To address this issue, this paper proposes KS3+, a new, highly efficient approach that allows a system engineer to query for a system solution with a few keywords that represent the required system tasks. Modeling the problem of answering such a keyword query as a dynamic programming problem, KS3+ can quickly find a system solution composed of services that perform the required system tasks. It offers an efficient paradigm that significantly reduces the time and effort during the process for building SBSs. The results of extensive experiments on a real-world web service dataset demonstrate the high efficiency and effectiveness of KS3+.

[1]  M. Brian Blake,et al.  Model-Based Automated Navigation and Composition of Complex Service Mashups , 2015, IEEE Transactions on Services Computing.

[2]  Hai Jin,et al.  Quality-Aware Service Selection for Service-Based Systems Based on Iterative Multi-Attribute Combinatorial Auction , 2014, IEEE Transactions on Software Engineering.

[3]  Danilo Ardagna,et al.  Adaptive Service Composition in Flexible Processes , 2007, IEEE Transactions on Software Engineering.

[4]  Eyhab Al-Masri,et al.  Investigating web services on the world wide web , 2008, WWW.

[5]  Xuanzhe Liu,et al.  Data-Driven Composition for Service-Oriented Situational Web Applications , 2015, IEEE Transactions on Services Computing.

[6]  Yixin Chen,et al.  QoS-Aware Dynamic Composition of Web Services Using Numerical Temporal Planning , 2014, IEEE Transactions on Services Computing.

[7]  R. Durrett Random Graph Dynamics: References , 2006 .

[8]  Klaus Moessner,et al.  Probabilistic Matchmaking Methods for Automated Service Discovery , 2014, IEEE Transactions on Services Computing.

[9]  Boi Faltings,et al.  Multi-Objective Quality-Driven Service Selection—A Fully Polynomial Time Approximation Scheme , 2014, IEEE Transactions on Software Engineering.

[10]  Matthias Klusch,et al.  OWLS-MX: A hybrid Semantic Web service matchmaker for OWL-S services , 2009, J. Web Semant..

[11]  Qiang He,et al.  Keyword Search for Building Service-Based Systems , 2017, IEEE Transactions on Software Engineering.

[12]  Anne H. H. Ngu,et al.  QoS-aware middleware for Web services composition , 2004, IEEE Transactions on Software Engineering.