A Comparison of Distributed Database Design Models

Cited 0 time in Web of Science Cited 0 time in Scopus

Rho, Sangkyu

Issue Date
College of Business Administration (경영대학)
Seoul Journal of Business, Vol.8 No.1, pp. 5-37
compares and evaluatesdata redundancytotal operating cost
Although numerous database design models and solution algorithms have been developed, there has been little work that compares and evaluates these models. Lack of such work has left us with several questions: Do the more comprehensive models actually result in better solutions than the simpler models? If so, what makes them better? Are they better under all conditions or only under certain conditions? Are there trade-offs between data redundancy and sophisticated operation allocation strategies? In this paper, we systematically compare and evaluate several distributed database design models in terms of total operating cost and average response time under various conditions. We vary the relative frequency of update queries and selectivities of queries. The results demonstrate that replication, join node selection, join order, and reduction by semijoin, all have significant impact on the efficiency of a distributed database system. Replication was most effective for retrieval intensive and high selectivity situations. Join node selection, join order, and reduction by semijoin were most effective for balanced retrieval/update and low selectivity situations. The results also suggest that there are trade-offs between total operating cost and average response time design criteria.
Files in This Item:
Appears in Collections:
College of Business Administration/Business School (경영대학/대학원)Dept. of Business Administration (경영학과)Seoul Journal of Business (SJB)Seoul Journal of Business Volume 08, Number 1 (2002)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.