COST-OPTIMAL DYNAMIC DATA REPLICATION FOR DISTRIBUTED DATABASE-SYSTEMS - DYVO

In this paper, we present a dynamic replication algorithm, DYVO, which could provide an optimal cost for operating replicas according to a read/write pattern of transactions. Unlike previous algorithms for dynamic replication, in which read one and write all available approach is used for preserving consistency of replicas, DYVO basically uses quorum approach for managing replicas. The quorum approach is basically able to encompass a large class of failures. Moreover, the quorum approach simplifies considerably the task maintaining the consistency of replicated data. As a result, DYVO is fault-tolerant to all kinds of failures and gives a way that minimizes overload for managing a replication algorithm.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1994-12
Language
ENG
Citation

MICROPROCESSING AND MICROPROGRAMMING, v.40, no.10-12, pp.747 - 750

ISSN
0165-6074
URI
http://hdl.handle.net/10203/4805
Appears in Collection
KGSM-Journal Papers(저널논문)
  • Hit : 331
  • Download : 49
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0