Multi-attribute optimization in service selection

As multiple service providers may compete to offer the same functionality with different quality of service (e.g., latency, fee, and reputation), a key issue in service computing is selecting service providers with the best user desired quality. Existing service selection approaches mostly rely on computing a predefined objective function. When multiple quality criteria are considered, users are required to express their preference over different (and sometimes conflicting) quality attributes as numeric weights. This is a rather demanding task and an imprecise specification of the weights could miss user desired services. We propose a multi-attribute optimization approach to tackle this issue. In particular, we develop a novel concept, called service skyline, and a set of service skyline computation techniques that return a set of most interesting service providers. These providers are non-dominant in all user interested quality attributes. Thus, the service skyline ensures that the user desired providers will be included. Analytical and experimental studies justify the performance of the proposed techniques. The relative small sizes of the service skylines also make it practical for service users to make selections from them.

[1]  Nikos Mamoulis,et al.  Scalable skyline computation using object-based space partitioning , 2009, SIGMOD Conference.

[2]  Hans-Peter Kriegel,et al.  The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.

[3]  Jarek Gryz,et al.  Maximal Vector Computation in Large Data Sets , 2005, VLDB.

[4]  Patrick Martin,et al.  Reputation-Enhanced QoS-based Web Services Discovery , 2007, IEEE International Conference on Web Services (ICWS 2007).

[5]  Bernhard Seeger,et al.  An optimal and progressive algorithm for skyline queries , 2003, SIGMOD '03.

[6]  Jian Pei,et al.  SUBSKY: Efficient Computation of Skylines in Subspaces , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[7]  John R. Smith,et al.  The onion technique: indexing for linear optimization queries , 2000, SIGMOD '00.

[8]  Tao Yu,et al.  Efficient algorithms for Web services selection with end-to-end QoS constraints , 2007, TWEB.

[9]  Werner Nutt,et al.  Rewriting aggregate queries using views , 1999, PODS.

[10]  Beng Chin Ooi,et al.  Efficient Progressive Skyline Computation , 2001, VLDB.

[11]  Seung-won Hwang,et al.  BSkyTree: scalable skyline computation using a balanced pivot selection , 2010, EDBT '10.

[12]  Athman Bouguettaya,et al.  Efficient access to Web services , 2004, IEEE Internet Computing.

[13]  Athman Bouguettaya,et al.  Deploying and managing Web services: issues, solutions, and directions , 2008, The VLDB Journal.

[14]  Quan Z. Sheng,et al.  Quality driven web services composition , 2003, WWW '03.

[15]  Donald Kossmann,et al.  The Skyline operator , 2001, Proceedings 17th International Conference on Data Engineering.

[16]  Jennifer Widom,et al.  Query optimization over web services , 2006, VLDB.

[17]  Athman Bouguettaya,et al.  Computing Service Skyline from Uncertain QoWS , 2010, IEEE Transactions on Services Computing.

[18]  Patrick Bosc,et al.  SQLf: a relational database language for fuzzy querying , 1995, IEEE Trans. Fuzzy Syst..

[19]  Donald Kossmann,et al.  Shooting Stars in the Sky: An Online Algorithm for Skyline Queries , 2002, VLDB.

[20]  Ashish Gupta,et al.  Aggregate-Query Processing in Data Warehousing Environments , 1995, VLDB.

[21]  Jun Zhang,et al.  Simlarity Search for Web Services , 2004, VLDB.

[22]  Valeria De Antonellis,et al.  Flexible Semantic-Based Service Matchmaking and Discovery , 2008, World Wide Web.

[23]  David Wai-Lok Cheung,et al.  Progressive skylining over Web-accessible databases , 2006, Data Knowl. Eng..

[24]  Michael Stonebraker,et al.  Predicate migration: optimizing queries with expensive predicates , 1992, SIGMOD Conference.

[25]  Qing Liu,et al.  Efficient Computation of the Skyline Cube , 2005, VLDB.

[26]  Jan Chomicki,et al.  Skyline with presorting , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[27]  Manish Parashar,et al.  A Peer-to-Peer Approach to Web Service Discovery , 2004, World Wide Web.

[28]  Divesh Srivastava,et al.  Answering Queries with Aggregation Using Views , 1996, VLDB.

[29]  Ilaria Bartolini,et al.  Efficient sort-based skyline evaluation , 2008, TODS.

[30]  Jian Pei,et al.  Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces , 2005, VLDB.

[31]  Wolf-Tilo Balke,et al.  Efficient Distributed Skylining for Web Information Systems , 2004, EDBT.

[32]  Dimitris Sacharidis,et al.  Ranking and Clustering Web Services Using Multicriteria Dominance Relationships , 2010, IEEE Transactions on Services Computing.

[33]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[34]  Vagelis Hristidis,et al.  PREFER: a system for the efficient execution of multi-parametric ranked queries , 2001, SIGMOD '01.

[35]  Vagelis Hristidis,et al.  Authority-based keyword search in databases , 2008, TODS.

[36]  Athman Bouguettaya,et al.  Framework for Web service query algebra and optimization , 2008, TWEB.