A Link-Based Ranking Model for Services

Usage-based ranking of distributed XML data

“…Each source s i offers a special service, called Importance Service (IS i ) with two operations, namely set(s, s , val) and get(s) that respectively sets and gets the importance of the source s, where s is the name of the source that gives importance value val to s. The importance computation is implemented by the asynchronous importance computation algorithm described in [8], during which the sources communicate their importance by means of the set operation of the corresponding importance service.…”

“…A similar approach is the one of [13], where each server refines the score of its local pages by periodically meeting with other servers in a peer-to-peer manner. [8] proposes an asynchronous algorithm for computing Web service importance.…”

“…The problem of ranking documents or services in a distributed environment has been considered in [16,13,8,14]. [16] defines and computes importance scores for web servers and web pages.…”

“…Our notion of usage takes into consideration the data contribution [8] to query evaluations and their access time during a time period. Apart from ranking XML data and sources, the importance scores may also help to decide about which remote data should be materialized (cached) locally for improving performance [3].…”