International Journal of Engineering and Technology

Consistent data availability and query processing are the two major issues to be considered in order to successfully design and implement scalable and cost efficient peer to peer database systems. These aims in turn depend on how we deal with the inherent dynamics of peer to peer systems. Though replication has been considered, traditionally as a solution to provide resilient data availability and query processing in these types of systems, but the cost efficiency of this measure is not considered to be optimal. In this paper, we propose a novel, more cost efficient method of providing data availability and query processing where we employ Distributed hash Tables (DHTs) algorithm which flattens the structure of the peer to peer database system optimally to satisfy these needs thereby eliminating the need to use replication.