Query Processing In
Peer to Peer
Networks
Under the Guidance of
Mrs. M. Annapoorani M.E.,
Project Members
T. Ashok Kumar
B. Jayesh
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community
Ask the community for help and clear up your study doubts
University Rankings
Discover the best universities in your country according to Docsity users
Free resources
Our save-the-student-ebooks!
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Peer to Peer Networks: Query Processing in Unstructured P2P Systems, Papers of Computer Science
A project aimed at getting average, sum, minimum, maximum, and count values from a database using aggregate rules in Peer to Peer (P2P) networks. The project compares and contrasts structured and unstructured P2P networks, their advantages and disadvantages, and the hardware and software requirements. The document also includes a list of modules and their descriptions.
Typology: Papers
2020/2021
1 / 28
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download Peer to Peer Networks: Query Processing in Unstructured P2P Systems and more Papers Computer Science in PDF only on Docsity!
Query Processing In
Peer to Peer
Networks
Under the Guidance of
Mrs. M. Annapoorani M.E.,
Project Members
T. Ashok Kumar
B. Jayesh
Abstract (^) In Peer to peer network, each machine works as a client and also as a server. (^) This project is used to get the average, sum, minimum, maximum, count values from the database using the aggregate rules. (^) Sum, average, min, max, count are the few aggregate rules.
Existing System (^) The existing system uses Structured P2P network. (^) In Structured P2P network, the location of nodes in the network are fixed and positioned. (^) In the existing system exact query processing is possible. (^) Structured P2P network is organized in such a way that data items are located only at specific nodes in the network. (^) Those nodes maintain some state information to enable efficient retrieval of data.
Disadvantages of Existing System (^) Structured nodes are not efficient and flexible enough for applications where nodes frequently join or leave the network. (^) In Existing System the nodes are selected sequentially and if any node gets disconnected, then exact answer is not received. (^) During disconnection of nodes identification of the disconnected nodes becomes tedious and sometimes impossible.
Advantages of Proposed System (^) We can join the nodes at random times and depart without a prior notification. (^) We can obtain the results very efficiently.
Peer to Peer Network (^) In a Peer to Peer network there is no need for a separate dedicated server. (^) Each system can act as a client and also as a server.
Disadvantages of P2P over Client Server model (^) The security in P2P is low compared to Client Server model. (^) Every user in P2P should know about the network maintenance and utilization mechanisms.
HARDWARE REQUIREMENT
Hard disk : 40 GB
RAM : 512 MB
Processor Speed : 3.00GHz
Processor : Pentium IV Processor
List of Modules
- Sign in
- Activepeers a. Peerlister b. SQL Connected Peers
- Viewtable and Fields
- Aggregation
- Report
Modules Description Sign in (^) The registration of the users and their passwords are done here. (^) Next using the login form, the users can enter inside the Query processing Unit. Active Peers a. Peerlister Peerlister lists the peers which are connected with the query node. b. SQL Connected Peers Out of all the peers, the peers connected with the sql server is listed here.
Register
Login
Two Phase Sampling
Random Nodes