A scheme for increasing availability in partitioned replicated databases

DOI10.1016/0020-0255(91)90056-ZMaRDI QIDQ751262zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 1991

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(91)90056-z

zbMATH Keywords

distributed database systemdynamic voting schemereplicated databases

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Database theory (68P15)

Recommendations

• A dynamic majority determination algorithm for reconfiguration of network partitions
• scientific article; zbMATH DE number 4092727
• Achieving graceful performance in distributed error-prone databases
• Optimal Termination Protocols for Network Partitioning
• Resilient data management for replicated mobile database systems

Cited in

(6)

• A dynamic majority determination algorithm for reconfiguration of network partitions
• Optimal Termination Protocols for Network Partitioning
• scientific article; zbMATH DE number 4092727 (Why is no real title available?)
• Resilient data management for replicated mobile database systems
• scientific article; zbMATH DE number 1487608 (Why is no real title available?)
• Achieving graceful performance in distributed error-prone databases

This page was built for publication: A scheme for increasing availability in partitioned replicated databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751262)