Scalability and Performance Analysis of CRUD Matrix Based Fragmentation Technique for Distributed Database

Distributed processing is an efficient way to improve performance of a database management system significantly. Distribution of data involves fragmentation, replication and allocation process. Previous research works provided fragmentation solution based on empirical data which are not applicable at the initial stage of a distributed database. In this paper we have presented a fragmentation technique that can be applied at the initial stage when no experimental data are present as well as in later stages of a distributed database system for partitioning the relations. Scalability of our proposed technique also investigated for different situation those may arise in practical cases of a distributed database. Experimental results show that our technique can solve initial fragmentation problem of distributed database system properly also compete with other non initial fragmentation techniques quite good in later stages.