Execution plans produced by traditional query optimizers for data integration queries may yield poor performance for several reasons. The cost estimates may be inaccurate, the mem...
Nowadays many data grid applications need to manage and process a huge amount of data distributed across multiple grid nodes and stored into heterogeneous databases. Grids encoura...
Giovanni Aloisio, Massimo Cafaro, Sandro Fiore, Ma...
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
This paper presents flexible protocols for dynamic database design and reconfiguration, enabling mobile database to be designed in such a way that data location, replication and e...
Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that such services deal with dynamically changing membership and...
Kishori M. Konwar, Peter M. Musial, Nicolas C. Nic...