首页    期刊浏览 2024年12月01日 星期日
登录注册

文章基本信息

  • 标题:SHORTEST PATH ALGORITHM FOR QUERY PROCESSING IN PEER TO PEER NETWORKS
  • 本地全文:下载
  • 作者:U.V.ARIVAZHAGU ; Dr.S.SRINIVASAN
  • 期刊名称:Indian Journal of Computer Science and Engineering
  • 印刷版ISSN:2231-3850
  • 电子版ISSN:0976-5166
  • 出版年度:2012
  • 卷号:3
  • 期号:3
  • 页码:444-448
  • 出版社:Engg Journals Publications
  • 摘要: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.
  • 关键词:Peer-to-Peer Network; Query Processing; Shortest Path Problem; Query Routing.
国家哲学社会科学文献中心版权所有