CDRT: An efficient clustering algorithm for distributed real-time database sites

Recently, the demand for real-time database is increasing. Most real-time systems are inherently distributed in nature. They need data to be obtained and updated in a timely fashion. Sometimes required data are at a particular location is not available, and needed to be obtained from remote site. This may take long time that make the temporal data invalid resulting in large number of tardy transactions with their fetal effect. Clustering the database sites nodes can help distributed real-time database systems to face the challenges meeting their time requirements. Reducing the large number of network sites into many clusters with smaller number of sites will effectively decrease the response time, resulting in better meeting of time constraints. In this work, we introduce a novel clustering algorithm for distributed real-time database that depend on both the communication time cost and the timing properties of data. The results showed lower communication time, higher database performance and better meeting of timing requirements.