Storage Efficient Replicated Databases

Divyakant Agrawal, Amr El Abbadi

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

In this paper, we propose a fragmentation method that reduces the storage overhead of replicated objects. We present a data management protocol for these fragmented objects, and show that this protocol is a generalization of quorum algorithms for replicated data in which objects are not fragmented. Although the protocol reduces storage requirements, it does not achieve a high level of resiliency for both read and write operations. By integrating a propagation mechanism with our protocol, we are able to achieve the same level of resiliency for both read and write operations as other quorum protocols, while reducing the storage cost.

Original languageEnglish
Pages (from-to)342-352
Number of pages11
JournalIEEE Transactions on Knowledge and Data Engineering
Volume2
Issue number3
DOIs
Publication statusPublished - Sep 1990

    Fingerprint

Keywords

  • Availability
  • distributed databases
  • fault tolerance
  • replication
  • storage

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this