Data replication in distributed databases has been investigated extensively with the hope that it will improve performance, reliability, and availability. However, the growth of the Internet has shown us that current replica management do not work well when the replicas are connected by an unreliable network, subject to congestion and dynamic topology changes. In this paper, we present a replic...

The unprecedented growth of available spatial data at geographically distributed locations coupled with the emergence of grid computing provides a strong motivation for designing a spatial grid which supports fast data retrieval and allows its users to transparently access data of any location from anywhere. This calls for efficient search and loadbalancing mechanisms. This paper focusses on dy...

It is increasingly common for an application’s data to reside at multiple disparate locations, while the application requires centralized access to its data. A simple solution is to replicate all relevant data at a central point, forwarding updates from master copies to replicas without any special processing or filtering along the way. This scheme maintains up-to-date centralized data, but inc...

Data replication in distributed databases has been investigated extensively with the hope that it will improve performance, reliability, and availability. However, the growth of the Internet has shown us that current replica management do not work well when the replicas are connected by an unreliable network, subject to congestion and dynamic topology changes. In this paper, we present a replic...

The mobile, wireless, and self-organizing features of ad hoc networks pose many challenges with respect to continuous availability and accessibility of data. In such a dynamic environment, there are many advantages in replicating a data item so there are multiple copies, including reduced response times and higher data availability. Also, if done efficiently, replication can help reduce energy ...

To improve data availability and reduce user access latency, geo-cloud based data replication is widely used in large global Web sites, such as Facebook. However, as the popularity of data is different and will change as time goes by, simple static replica creation strategies that assign the same number of replicas to all data, never changing thereafter, are not suitable. To this issue, we prop...

A Dynamic Data Driven Application Systems (DDDAS) approach is developed for evaluation of fluid-thermal systems wherein a complete specification of the boundary conditions is not known a priori and experimental diagnostics are restricted to a limited region of the flowfield. The methodology is applied to the configuration of a heated jet injected into a laminar boundary layer where the jet temp...

This work present several advances in the understanding of dynamic data structures in the bit-probe model: • We improve the lower bound record for dynamic language membership problems to Ω(( lg n lg lg n ) ). Surpassing Ω(lg n) was listed as the first open problem in a survey by Miltersen. • We prove a bound of Ω( lg n lg lg lg n ) for maintaining partial sums in Z/2Z. Previously, the known bou...