Research Into The Algorithms Of Transaction Concurrency Control In Database Grid

As is known as the third wave of the internet since the mid-1990s and has aroused widespread interest.Grid is being pushed from scientific computing to industrial fields. At the same time,as is a major carrier of information,database plays a very important role in many fields.Database systems are characterized as autonomy,heterogeneity and distribution,so they can not provide uniform interfaces to satisfy flexible resource sharing and data access.Grid was defined as flexible,secure,coordinated resource sharing among dynamic collections of individuals,institutions.Therefore,grid could meet the request of resource sharing.As a result,how to improve the database grid system concurrent access to improve the utilization of the system has become an urgent problem that need to solve.The grid,the database grid,the relevant concepts and techniques of the distributed transaction are deeply studied in this paper.Based on an analysis of the advantage and disadvantage of the current model of distributed database services,GALTT (Global-Agent-Local Transaction Tree) model is promoted.Because of the advantage and disadvantage of the algorithms of the traditional transaction processing and the characters of the database,GTPS(Grid Transaction Processing Strategy) is promoted to enhance the concurrency degree of the grid database transaction.This paper presents a model of processing transaction and the algorithm of processing transaction,and the realization of the system.2PL and GTPS are used in this experiment to analyze the performance of processing transaction of the both.The consuming time with the rising number of the grid transaction,and the grid transaction failure rate with the rising number of the grid transaction are gotten with 2PL and GTPS in the experiment.Experiment results show that it is more advantageous to use GTPS than 2PL.