Five Steps to Construct a Model of Data Allocation for Distributed Database Systems

  • Authors:
  • Nadeem H. Daudpota

  • Affiliations:
  • Department of Computer Science, Beijing University of Aeronautics and Astronautics, 37-Xueyuan Road, Beijing 100083, P.R. China

  • Venue:
  • Journal of Intelligent Information Systems
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

The allocation of data to nodes in a computer communications networkis a critical issue in distributed database design, specially in wide areanetwork where optimizing the distributed queries is the main objective. Numerous models of data allocation have been presented so far (Ceri and Pelagatti, 1986; Lee et al., 1994; Apers, 1988; Mahmood et al., 1994; Theel, 1994; Saha andMukherjee, 1994; Walfson and Jajodia, 1995), butno optimal or universally accepted algorithm exists yet, and very few algorithms havebeen implemented to date (Rob and Cornonel, 1993). In this paper a method toconstruct a model of data allocation for distributed database system has beenproposed. The adopted method for the construction of the data allocation model leadsto an efficient model of its kind. The proposed model not only solves distributeddatabase design problem, but also solves distributed database maintenance problem bycovering initial allocation and post allocation of the data. The efficiency ofproposed model has been proved by comparing proposed model with other relevant models.