We study the impact of collusion –nepotistic linking– in a Web graph in terms of Pagerank. We prove a bound on the Pagerank increase that depends both on the reset probability...
Ricardo A. Baeza-Yates, Carlos Castillo, Vicente L...
We analyze the recent phenomenon termed a Link Bomb, and investigate the optimal attack pattern for a group of web pages attempting to link bomb a specific web page. The typical ...
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential wa...
As more and more Web services are deployed, Web service’s discovery mechanisms become essential. Similar services can have quite different QoS behaviors. For service selection ...
In this paper, we propose an approach to materialize XML data warehouses based on the frequent query patterns discovered from historical queries issued by users. The schemas of in...
Most research works on web retrieval latency are object-level based, which we think is insufficient and sometimes inaccurate. In this paper, we propose a fine grained operation-le...
We propose a technique for the automated synthesis of new comeb services. Given a set of abstract BPEL4WS descriptions of component services, and a composition requirement, we aut...
Marco Pistore, Paolo Traverso, Piergiorgio Bertoli...