SHORTEST PATH ALGORITHM FOR QUERY PROCESSING IN PEER TO PEER NETWORKS

Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 3

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.

Authors and Affiliations

U. V. ARIVAZHAGU , Dr. S. SRINIVASAN

Keywords

Related Articles

CLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS

This paper attempts to introduce the concept of moment invariance into the classification algorithm based on the morphological boundary extraction and generalized skeleton transform, and tries to propose a new method abo...

Survey on Privacy Preservation in contextaware web services 

Context awareness is a property of mobile devices that is defined complementarily to location awareness where as location may determine how certain processes in a device operates, context may be applied more flexibly wit...

COMPARISON AND EVALUATION ON METRICS BASED APPROACH FOR DETECTING CODE CLONE

Many techniques were proposed for detecting code clone. In this paper we have compared the metrics based on speed, quality and their cost as these are the most that affects due to code clone. The strength and weakness of...

Concert Investigation of Novel Deterministic Interleaver for OFDM-IDMA System

In recent days the expectations of wireless communication systems have to configure new technologies that support high capacity to match the increase in demands on wireless service. A new hybrid scheme namely Orthogonal...

GDRP: A NOVEL APPROACH FOR POWER OPTIMIZATION IN WIRED CORE NETWORKS

The numbers of applications in the internet are increasing tremendously day by day which results into degrading the network performance because of heavy traffic load on the core routers which causes into more power consu...

Download PDF file
  • EP ID EP119682
  • DOI -
  • Views 80
  • Downloads 0

How To Cite

U. V. ARIVAZHAGU, Dr. S. SRINIVASAN (2012). SHORTEST PATH ALGORITHM FOR QUERY PROCESSING IN PEER TO PEER NETWORKS. Indian Journal of Computer Science and Engineering, 3(3), 444-448. https://europub.co.uk/articles/-A-119682