ABSTRACT

Peer to peer file sharing database project explains about implementing a sampling based computing technique for increasing consistency and increase query processing time in ad hoc aggregation databases.

On internet peer to peer networks utilize 70 percent of bandwidth and lot of load comes from query processing.

As database is accessed to download and upload documents, media files, software applications there is need for efficient query processing methods.

Solving this problem is not a easy task and time consuming and also difficult to implement. In this peer to peer file sharing database project we try to propose an efficient method to increase efficiency of database querying

How P2P works?

A peer-to-peer network allows computer hardware and software to communicate without the need for a server. Unlike client-server architecture, there is no central server for processing requests in a P2P architecture. The peers directly interact with one another without the requirement of a central server.

Now, when one peer makes a request, it is possible that multiple peers have the copy of that requested object. Now the problem is how to get the IP addresses of all those peers. This is decided by the underlying architecture supported by the P2P systems. By means of one of these methods, the client peer can get to know about all the peers which have the requested object/file and the file transfer takes place directly between these two peers.

THREE SUCH ARCHITECTURES

1. Centralized Directory
2. Query Flooding
3. Exploiting Heterogeneity

CENTRALIZED DIRECTORY

• It is somewhat similar to client server architecture in the sense that it maintains a huge central server to provide directory service.
• All the peers inform this central server of their IP address and the files they are making available for sharing.
• The server queries the peers at regular intervals to make sure if the peers are still connected or not.
• So basically this server maintains a huge database regarding which file is present at which IP addresses.

QUERY FLOODING

• Unlike the centralized approach, this method makes use of distributed systems.
• In this, the peers are supposed to be connected into an overlay network. It means if a connection/path exists from one peer to other, it is a part of this overlay network.
• In this overlay network, peers are called as nodes and the connection between peers is called an edge between the nodes, thus resulting in a graph-like structure.

EXPLOITING HETEROGENEITY

• This P2P architecture makes use of both the above discussed systems.
• It resembles a distributed system like Gnutella because there is no central server for query processing.
• But unlike Gnutella, it does not treat all its peers equally. The peers with higher bandwidth and network connectivity are at a higher priority and are called as group leaders/super nodes. The rest of the peers are assigned to these super nodes.
• These super nodes are interconnected and the peers under these super nodes inform their respective leaders about their connectivity, IP address and the files available for sharing.