Storage efficient replicated databases

Divyakant Agrawal, Amr El Abbadi

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

A fragmentation method that reduces the storage overhead of replicated objects is proposed. A data-management protocol for these fragmented objects is presented, and it is shown 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 the protocol, the same level of resiliency is achieved for both read and write operations as other quorum protocols, while the storage cost is reduced.

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

Fingerprint

Information management
Costs

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Storage efficient replicated databases. / Agrawal, Divyakant; El Abbadi, Amr.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 2, No. 3, 01.09.1990, p. 342-352.

Research output: Contribution to journalArticle

Agrawal, Divyakant ; El Abbadi, Amr. / Storage efficient replicated databases. In: IEEE Transactions on Knowledge and Data Engineering. 1990 ; Vol. 2, No. 3. pp. 342-352.
@article{f4e77544f3a340d29701ab53f917898f,
title = "Storage efficient replicated databases",
abstract = "A fragmentation method that reduces the storage overhead of replicated objects is proposed. A data-management protocol for these fragmented objects is presented, and it is shown 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 the protocol, the same level of resiliency is achieved for both read and write operations as other quorum protocols, while the storage cost is reduced.",
author = "Divyakant Agrawal and {El Abbadi}, Amr",
year = "1990",
month = "9",
day = "1",
doi = "10.1109/69.60797",
language = "English",
volume = "2",
pages = "342--352",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "3",

}

TY - JOUR

T1 - Storage efficient replicated databases

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 1990/9/1

Y1 - 1990/9/1

N2 - A fragmentation method that reduces the storage overhead of replicated objects is proposed. A data-management protocol for these fragmented objects is presented, and it is shown 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 the protocol, the same level of resiliency is achieved for both read and write operations as other quorum protocols, while the storage cost is reduced.

AB - A fragmentation method that reduces the storage overhead of replicated objects is proposed. A data-management protocol for these fragmented objects is presented, and it is shown 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 the protocol, the same level of resiliency is achieved for both read and write operations as other quorum protocols, while the storage cost is reduced.

UR - http://www.scopus.com/inward/record.url?scp=0025483060&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025483060&partnerID=8YFLogxK

U2 - 10.1109/69.60797

DO - 10.1109/69.60797

M3 - Article

AN - SCOPUS:0025483060

VL - 2

SP - 342

EP - 352

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 3

ER -