Performance analysis of parallel database in grid

This paper presents a grid frame composed of a preprocessing database server and PC nodes. It divides the whole database into different parts for different PC nodes, where the corresponding data are stored. The server is responsible for the clients' interaction, order partition and management of the whole grid. It implements the parallel database in grid. The paper calculates the execution time of the operation in parallel database. It deduces the formula of the speedup, considering the network and the data interaction. The method derives the maximum of the speedup by calculating its limit in ideal state. Then for the fixed database size, with the number of grid processor nodes growing and the complexity of the database operation increasing, the speedup of this grid frame achieves its maximum value.