director affiliation（主管联系）.pdf

U.V.Arivazhagu et al / Indian Journal of Computer Science and Engineering (IJCSE) SHORTEST PATH ALGORITHM FOR QUERY PROCESSING IN PEER TO PEER NETWORKS U.V.ARIVAZHAGU * Research Scholar, Sathyabama University, Chennai, Tamilnadu, India arivu12680@ Dr.S.SRINIVASAN Director Affiliation Head of Computer Science and Engineering Master of Computer Applications, Anna University of Technology, Madurai, Tamilnadu, India Abstract Peer-to-Peer network implements a new environment in database by query processing system. Nowadays, a key challenging for processing the queries and query answering technique. In this paper we propose a research work on how query processing can be done in a P2P system efficiently by discovering the network topology, how the query can be processed in a database by using shortest path problem. Cryptographic algorithm is implemented for routing the queries in a secured manner. Compare to the previous work our proposed approach minimize the delay, fast access of queries and query routing process provide more security. Keywords : Peer-to-Peer Network; Query Processing; Shortest Path Problem; Query Routing. 1. Introduction Recently, peer-to-peer systems have become a very active research area today and their potential use in future applications. The Peer to Peer network is completely independent in which no central server are present and used to connect the database with other peer database in a decentralized manner. An important problem is the routing of queries which contain relevant document