Advertisement

Data replication in a distributed system: A performance study

  • San-Yih Hwang
  • Keith K. S. Lee
  • Y. H. Chin
Parallel and Distributed Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1134)

Abstract

In this paper we investigate the performance issues of data replication in a loosely coupled distributed database system, where a set of database servers are connected via a network. A database replication scheme, Replication with Divergence, which allows some degree of divergence between the primary and the secondary copies of the same data object, is compared to other two schemes that, respectively, dis-allows replication and maintains all replicated copies consistent at all times. The impact of some tunable factors, such as cache size and the update propagation probability, on the performance of Replication with Divergence is also investigated. These results shed light on the performance issues that were not addressed in previous studies on replication of distributed database systems.

Keywords

Arrival Rate Data Item Local Server Primary Copy Average Response Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Alonso, D. Barbar, and H. Garcia-Molina. Data caching issues in an information retrieval system. ACM Transaction on Database Systems, 15(3):359–384, 1990.CrossRefGoogle Scholar
  2. 2.
    D. Barbara-Milla and H. Garcia-Molina. The demarcation protocol: A technique for maintaining constraints in distributed database systems. The International Journal on Very Large Data Bases, 3(3):325–355, 1994.Google Scholar
  3. 3.
    A. Bhide, A. Goyal, H. I. Hsiao, and Anant Jhingran. An efficient scheme for providing high availability. In Proc. of ACM SIGMOD Int'l. Conf. on Management of Data, pages 236–245, 1992.Google Scholar
  4. 4.
    S. B. Davidson. Replicated data and partition failures. In S. Mullender, editor, Distributed Systems, pages 265–292. Addison Wesley, 1989.Google Scholar
  5. 5.
    L. Kleinrock. Queueing Systems, Vol. 1: Theory. Wiley-Innterscience, New York, 1975.Google Scholar
  6. 6.
    R. Lenz, T. Kirsche, and B. Reinwald. Aspect — specifying consistency requirements for replicated data. In Proc. of the Seventh International Conference on Parallel and Distributed Computing Systems, 1994.Google Scholar
  7. 7.
    C. A. Polyzois and H. Garcia-Molina. Evaluation of remote backup algorithms for transaction processing systems. ACM Transaction on Database Systems, 19(3):423–449, 1994.CrossRefGoogle Scholar
  8. 8.
    M. Rusinkiewicz, A. Sheth, and G. Karabatis. Specifying interdatabase dependencies in a multidatabase environment. IEEE Computer, Dec. 1991.Google Scholar
  9. 9.
    D. Yavin. Replication's fast track. Bytes, Aug. 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • San-Yih Hwang
    • 1
  • Keith K. S. Lee
    • 2
  • Y. H. Chin
    • 2
  1. 1.Department of Information ManagementNational Sun Yat-Sen UniversityKaohsiungTaiwan
  2. 2.Department of Computer ScienceNational Tsing Hua UniversityHsin-ChuTaiwan

Personalised recommendations