Progressive approximate aggregate queries with a multi-resolution tree structure
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Web Services and Business Transactions
World Wide Web
Proceedings of the 17th International Conference on Data Engineering
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
QoS computation and policing in dynamic web service selection
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
The EEE-05 Challenge: A New Web Service Discovery and Composition Competition
EEE '05 Proceedings of the 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'05) on e-Technology, e-Commerce and e-Service
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Maximal vector computation in large data sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A QoS Broker Based Architecture for Efficient Web Services Selection
ICWS '05 Proceedings of the IEEE International Conference on Web Services
Run-Time Monitoring of Instances and Classes of Web Service Compositions
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Reliable QoS monitoring based on client feedback
Proceedings of the 16th international conference on World Wide Web
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient processing of top-k dominating queries on multi-dimensional data
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Probabilistic top-k and ranking-aggregate queries
ACM Transactions on Database Systems (TODS)
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Efficient sort-based skyline evaluation
ACM Transactions on Database Systems (TODS)
Top-k dominating queries in uncertain databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Top-k dominant web services under multi-criteria matching
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Multi-dimensional top-k dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
Selecting skyline services for QoS-based web service composition
Proceedings of the 19th international conference on World wide web
Threshold-based probabilistic top-k dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
Computing Service Skyline from Uncertain QoWS
IEEE Transactions on Services Computing
Computing Service Skylines over Sets of Services
ICWS '10 Proceedings of the 2010 IEEE International Conference on Web Services
Asymptotically efficient algorithms for skyline probabilities of uncertain data
ACM Transactions on Database Systems (TODS)
Top-k Web Service Compositions Using Fuzzy Dominance Relationship
SCC '11 Proceedings of the 2011 IEEE International Conference on Services Computing
Top-k combinatorial skyline queries
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Selecting Skyline Web Services from Uncertain QoS
SCC '12 Proceedings of the 2012 IEEE Ninth International Conference on Services Computing
Hi-index | 0.00 |
Traditional service selection schemes require users to define a utility function by assigning weights to each quality-of-service (QoS) metric. To relieve users from the professional knowledge, skyline techniques have been studied recently by several researchers. However, the size of skyline services is sometimes not easy controlled due to intrinsic attributes of services. Additionally, we observe that most QoS metrics may fluctuate during run-time. Considering such uncertainty and dynamics, in this paper, we propose to obtain probabilistic top-k dominating services with uncertain QoS. Different from previous works, our approach employs the probabilistic characteristic of service instances and calculates the dominating abilities of services so as to achieve an accurate selection. Experimental results have shown the feasibility and effectiveness of our approach.