Data mining: concepts and techniques
Data mining: concepts and techniques
ACM SIGCOMM Computer Communication Review
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Search in JXTA and Other Distributed Networks
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
Self Improving Coordination in Multi Agent Filtering Framework
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Data sharing and information retrieval in wide-area distributed systems
Data sharing and information retrieval in wide-area distributed systems
Cooperative Community Selection in Multi Agent Filtering Framework
IAT '05 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Composing mappings among data sources
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Queries and updates in the coDB peer to peer database system
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A distributed algorithm for robust data sharing and updates in p2p database networks
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
| Hi-index | 0.00 |
As a user attention has become a precious resource, a special care has to be taken to reduce the time needed for answering queries in P2P networks. Existing solutions are usually not fully aware of the seriousness to carefully use available network resources, and they are often focused on guarantying that results are found or that given update is propagated to all peers. Since the costs for giving such guaranties might be extremely large, a core of this paper is focused on presenting one update policy that carefully utilises available network resources and tries to improve itself by learning the importance of available peers. The rationality of having such update policy is supported by analysing the usage of peers together with estimating the load values of different network links.