02251oam 2200457zu 450 991014120530332120241212220159.09781457706479145770647497814577064621457706466(CKB)2670000000131674(SSID)ssj0000669907(PQKBManifestationID)12236017(PQKBTitleCode)TC0000669907(PQKBWorkID)10732788(PQKB)10961790(NjHacI)992670000000131674(EXLCZ)99267000000013167420160829d2011 uy engur|||||||||||txtccr2011 International Workshop on the Maintenance and Evolution of Service-Oriented and Cloud-Based Systems[Place of publication not identified]IEEE20111 online resourceBibliographic Level Mode of Issuance: Monograph9781457706455 1457706458 To ensure that consumer requests for web services are served successfully and effectively amidst overwhelming options, one must narrow the web service search to only the most qualified, highest-ranked services. However, today, the ranking of services is done only with regards to static attributes or with a snapshot of current values, resulting in low quality search results. To improve user experience, one must consider dynamic quality of service measures and address the practical challenges they incur. In this paper, we propose using histograms and an area-to-right-of-threshold function to handle the fluctuation and absence of attributes values effectively. This permits utilizing well-established techniques for selecting web services, such as skyline and top-k. We also discuss algorithmic considerations to efficiently produce dynamic web service discovery results.Web servicesCongressesWeb services006.76IEEE StaffPQKBPROCEEDING99101412053033212011 International Workshop on the Maintenance and Evolution of Service-Oriented and Cloud-Based Systems2532287UNINA