Database placement in communication networks for minimizing the overall transmission cost

  • Authors:

  • X.-M Lin;M.E Orlowska;Y.-C Zhang

  • Affiliations:

  • Department of Computer Science, The University of Queensland St. Lucia, QLD 4072, Australia;Department of Computer Science, The University of Queensland St. Lucia, QLD 4072, Australia;Department of Computer Science, The University of Queensland St. Lucia, QLD 4072, Australia

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 1994

Quantified Score

Hi-index 0.98

Visualization

Abstract

The minimum spanning tree write policy for the maintenance of the consistency of a distributed database, where replicated data exist, has been proposed in [1]. In this paper, we first present a data placement heuristic algorithm in general networks for minimizing the overall transmission cost for processing the typical demands of queries (by a ''simple'' process strategy) and updates (by the minimum spanning tree write policy). Several interesting optimality estimation results of this algorithm are shown, while the computational intractability of the complete optimization, with respect to the simple strategy, is shown as well. Secondly, we apply a classical climbing hill technique to obtain a dynamic database placement algorithm based on an employed optimizer-a collection of distributed query process algorithms. This is guaranteed to output a ''locally optimal'' data allocation. The implementation results also show that those two heuristics work well in practice.