Abstract
Web services are one of important components in the service-oriented computing paradigm. As the increasing number of Web services is available for service requests, it is demand to develop an algorithm for ranking them with respect to some criteria. In addition, the algorithm should be capable of taking into account the fact that the user requirements for a service may be diverse. This paper presents approaches for ranking Web services in different scenarios. Two algorithms are developed for this purpose
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kleinberg J (1999) Authoritative sources in a hyperlinked environment. Journal of ACM, 46: 604–632
Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: Bringing order to the web, SIDL-WP-1999-0120, Stanford University
Page L, Brin S (1998) The anatomy of a large-scale hypertextual web search engine. Computer Networks 30:1–7
Guo L, Shao F, Botev C, Shanmugasundaram J (2003) XRANK: Ranked Keyword Search over XML Documents. ACM SIGMOD, San Diego, pp 16–27
Bhalotia G, Hulgeri A, Nakhe C, Chakrabarti S, Sudarshan S (2002) Keyword searching and browsing in databases using BANKS. In: 18th International Conference on Data Engineering (ICDE), pp 431–440
Balmin A, Hristidis V, Papakonstantinou Y (2004) Objectrank: Authority-based keyword search in databases. In: Proceedings of the 30th VLDB Conference, Toronto, pp 564–575
Huang X, Xue Q, Yang J (2003) Tuplerank and implicit relationship discovery in relational databases. Advances in Web-Age Information Management LNCS, 2762/2003, pp 445–457
Dwork, Kumar R, Naor M, Sivakumar D (2001) Rank aggregation methods for the web. In: Proceedings of the 10th International World Wide Web Conference, pp 613–622
Fagin R, Lotem A, Naor M (2003) Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences 66 : 614–656
Fagin R, Kumar R, Mahdian M, Sivakumar D, and Vee E (2006) Comparing partial rankings, SIAM J. Discrete Mathematics 20:628–648
Agrawal R, Rantzau R, Terzi E (2006) Context-sensitive ranking. ACM SIGMOD, Chicago, IL, USA, pp 383–394
Zhang Z, Hwang S, Chang KCC (2006) Boolean+Ranking: querying a database by K-constrained optimization. In: ACM SIGMOD, Chicago, IL, USA pp 359–370
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this chapter
Cite this chapter
Huang, X. (2007). WSRank: A New Algorithm for Ranking Web Services. In: Labiod, H., Badra, M. (eds) New Technologies, Mobility and Security. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6270-4_44
Download citation
DOI: https://doi.org/10.1007/978-1-4020-6270-4_44
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-6269-8
Online ISBN: 978-1-4020-6270-4
eBook Packages: EngineeringEngineering (R0)