Performance Analysis of Multilevel Indices for Service Repositories

There are many different index structures for servicerepositories, such as sequential index, inverted index and multilevelindices that includes three deployments. Different servicesets maybe have different characteristics that may affect performancefrom different aspects. What characteristic could affectretrieval performance? How to select an optimal storage structurefor a given service set? To address these issues, this paperanalyses five indexing models and proposes expectation of traversedservice count to estimate performance of service retrieval. The proposed expectation formulas of five indices reveal whatdifferent characteristics of a service set could affect its retrievalperformance for different indices. Experimental results validatecorrectness of the proposed formulas.

[1]  Ching-Seh Wu,et al.  Tree-based Search Algorithm for Web Service Composition in SaaS , 2012, 2012 Ninth International Conference on Information Technology - New Generations.

[2]  Changjun Jiang,et al.  An Adaptive Multilevel Indexing Method for Disaster Service Discovery , 2015, IEEE Transactions on Computers.

[3]  MengChu Zhou,et al.  A Relational Taxonomy of Services for Large Scale Service Repositories , 2012, 2012 IEEE 19th International Conference on Web Services.

[4]  Paolo Traverso,et al.  Service-Oriented Computing: a Research Roadmap , 2008, Int. J. Cooperative Inf. Syst..

[5]  Zhaohui Wu,et al.  Inverted Indexing for Composition-Oriented Service Discovery , 2007, IEEE International Conference on Web Services (ICWS 2007).

[6]  Alexander Schill,et al.  Advanced Approach to Web Service Composition , 2014, ACS.

[7]  V. S. Ananthanarayana,et al.  Dynamic Web Service Composition Based on Operation Flow Semantics , 2010, ICISTM.

[8]  Xiaomeng Su,et al.  A Survey of Automated Web Service Composition Methods , 2004, SWSWPC.

[9]  Soundar R. T. Kumara,et al.  Effective Web Service Composition in Diverse and Large-Scale Service Networks , 2008, IEEE Transactions on Services Computing.

[10]  Mengchu Zhou,et al.  Automatic Web service composition based on Horn clauses and Petri nets , 2011, Expert Syst. Appl..

[11]  Soundar R. T. Kumara,et al.  Web Service Planner (WSPR): An Effective and Scalable Web Service Composition Algorithm , 2007, Int. J. Web Serv. Res..

[12]  Wolf-Tilo Balke,et al.  Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization , 2010, 2010 IEEE International Conference on Web Services.

[13]  Mazen Malek Shiaa,et al.  An Incremental Graph-based Approach to Automatic Service Composition , 2008, 2008 IEEE International Conference on Services Computing.

[14]  Chang Guofeng.  A Web Service Discovery Approach for QoS-Aware Service Composition , 2012 .

[15]  Joonho Kwon,et al.  Redundant-Free Web Services Composition Based on a Two-Phase Algorithm , 2008, 2008 IEEE International Conference on Web Services.

[16]  Yixin Yan,et al.  Automatic Service Composition Using AND/OR Graph , 2008, 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services.

[17]  Ansuman Banerjee,et al.  A Scalable and Approximate Mechanism for Web Service Composition , 2015, 2015 IEEE International Conference on Web Services.

[18]  Joonho Kwon,et al.  Scalable and efficient web services composition based on a relational database , 2011, J. Syst. Softw..

[19]  Joonho Kwon,et al.  Non-redundant web services composition based on a two-phase algorithm , 2012, Data Knowl. Eng..

[20]  Jun Ma,et al.  An Efficient Approach to Web Services Discovery and Composition when Large Scale Services are Available , 2006, 2006 IEEE Asia-Pacific Conference on Services Computing (APSCC'06).

[21]  Haisheng Li,et al.  A Method of Semantic Web Service Automatic Composition Based on Genetic Algorithm , 2012 .

[22]  MengChu Zhou,et al.  A Multilevel Index Model to Expedite Web Service Discovery and Composition in Large-Scale Service Repositories , 2016, IEEE Transactions on Services Computing.