In distributed database systems, tables are frequently fragmented and replicated over a number of sites in order to reduce network communication costs. How to fragment, when to rep...
Jon Olav Hauglid, Norvald H. Ryeng, Kjetil N&oslas...
In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is ...
In a number of application areas, distributed database systems can be used to provide persistent storage of data while providing efficient access for both local and remote data. W...
Distributed database design is a complex process that involves a set of distinct aspects for the accomplishment of an adequate data distribution (Buretta 1997). Many of these aspec...
Distributed database applications are a wide use of distributed systems. One of the major advantages of distributed database systems is the potential for achieving high availabili...
We present the notion of a distributed database made up entirely of mobile components. Since disconnections will be frequent in such an environment, we develop a disconnection and...
To address the of mining a huge volume of geographically distributed databases, we propose two approaches. The first one is to download only a sample of each database. The second ...
Classical distributed database systems monolithically offer distribution transparency and higher performance. This is made possible by making data available and closer to the appl...
The burgeoning amount of textual data in distributed sources combined with the obstacles involved in creating and maintaining central repositories motivates the need for effective ...
Shenzhi Li, Christopher D. Janneck, Aditya P. Bela...