Join algorithm based on data grid

Data grid is a distributed architecture for data management, which could provide the coordinated management mechanisms for data distributed across remote resources and form a single, virtual environment for data access, management and process by integrating many data sets distributed in the network. Database management system acts as an important role on data grid. In all kinds of database operations, join operation is a common-used and complex operation that needs much more time to complete than other operations. The join algorithm of massive data on data grid is studied in this paper. The proposed algorithm uses relation reduction algorithm, row blocking technique, and pipelined parallelism to solve the problem of heterogeneity of network bandwidth between nodes on data grid. The analysis and experimental results show that the performance of the algorithm is good in minimizing the response time by decreasing network transmission cost and increasing parallelism of I/O and CPU.