Download now Free registration required
Peer-To-Peer networks (P2P) have gained great attention and popularity. One key challenge aspect in Unstructured P2P resource sharing environments is efficient searching algorithm. Flooding and Random Walk (RW) are two typical search algorithms. Flooding searches aggressively and covers most nodes but it generates large amount of query messages. RW searches conservatively and at each hop it generates a fixed amount of query messages but it takes longer search time. This paper proposes the Dynamic Search Algorithm (DS), a generalization of flooding and RW. It resembles flooding for short-term search and RW for long-term search. This system describes a multi-database system as a 4 tiered Client-Server DBMS architecture. The proposed system provides remarkable changes in database servers which process thousands of concurrent queries.
- Format: PDF
- Size: 115.3 KB