Design and analysis of object allocation and replication algorithms in distributed databases for stationary and mobile computing systems

Abstract

Over the past two decades, distributed database systems (DDBSs) have received considerable attention and attracted immense research efforts in the computer domain. In this thesis, we concentrate on exposing the underlying key challenges in designing on-line algorithms to handle unpredictable requests that arrive at a DDBS. We design several dynamic on-line algorithms for the object allocation and object replication issues in the application domains of both stationary and mobile computing domain. Our objective is to provide a theoretical framework and rigorously analyze the performance of the proposed algorithms using competitive analysis. Further, we also implement one of the proposed algorithms in a real-life system to study its performance under variant conditions. The experimental results, coupled with the competitive analysis, clearly demonstrate the influences of several relevant parameters on the system performance, and give more insights on the design of object allocation and replication algorithms for DDBSs.