DETERMINING LOWEST COST COMMUNICATION PATH IN DISTRIBUTED DATABASE SYSTEM.

Main Article Content

Rakesh Kumar Pandey
Dr. Sachindra Kumar Azad

Abstract

Relational Database is interpreted as collection of interrelated data or records, where Database Management System is software of synthesize programs used to manage overall problem arises in the Relational database system. Join Operation is used to combine more than one relation using single query statement. Sometimes, it is impossible to get result from a single relation of the relational database in their case join operation is useful to fetch data from more than one relation of the database. Join is a performed as Cartesian product followed by some specific condition process. In this paper we are going to proposed, an algorithm that reduce the communication cost when the join operation is performed on the distributed database query system. In distributed database system, join operation is performed on different sites of the communication network. This proposed algorithm is automatically selecting the lowest cost communication path to perform the join operation on relational database.

Downloads

Download data is not yet available.

Article Details

Section
Articles