论文信息 - WSRank: A New Algorithm for Ranking Web Services

WSRank: A New Algorithm for Ranking Web Services

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

Xiaodi Huang

[1] Jun Yang,et al. TupleRank and Implicit Relationship Discovery in Relational Databases , 2003, WAIM.

[2] Seung-won Hwang,et al. Boolean + ranking: querying a database by k-constrained optimization , 2006, SIGMOD Conference.

[3] Ronald Fagin,et al. Comparing Partial Rankings , 2006, SIAM J. Discret. Math..

[4] Moni Naor,et al. Optimal aggregation algorithms for middleware , 2001, PODS.

[5] Feng Shao,et al. XRANK: ranked keyword search over XML documents , 2003, SIGMOD '03.

[6] Rajeev Motwani,et al. The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[7] Vagelis Hristidis,et al. ObjectRank: Authority-Based Keyword Search in Databases , 2004, VLDB.

[8] Massimo Marchiori,et al. The Limits of Web Metadata, and Beyond , 1998, Comput. Networks.

[9] Moni Naor,et al. Rank aggregation methods for the Web , 2001, WWW '01.

[10] Ralf Rantzau,et al. Context-sensitive ranking , 2006, SIGMOD Conference.

[11] Sergey Brin,et al. The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[12] S. Sudarshan,et al. Keyword searching and browsing in databases using BANKS , 2002, Proceedings 18th International Conference on Data Engineering.

[13] Jon Kleinberg,et al. Authoritative sources in a hyperlinked environment , 1999, SODA '98.