Achieving graceful performance in distributed error-prone databases

DOI10.1007/BF01784718MaRDI QIDQ751801zbMATH OpenFDO

Authors K. Brahmadathan, K. V. S. Ramarao

Publication date 1991

Published in Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

distributed databasesreplica control algorithms

Mathematics Subject Classification ID

Database theory (68P15) Parallel algorithms in computer science (68W10)

Recommendations

• A scheme for increasing availability in partitioned replicated databases
• An Information-Based Model for Failure-Handling in Distributed Database Systems
• Increasing the resilience of distributed and replicated database systems
• Concurrency and availability as dual properties of replicated atomic data
• A proof technique for concurrency control and recovery algorithms for replicated databases

Cites work

• An optimality theory of concurrency control for databases
• Read-only transactions in a distributed database
• The notions of consistency and predicate locks in a database system

Cited in

(4)

• Measuring the effects of distributed database models on transaction availability measures
• An Information-Based Model for Failure-Handling in Distributed Database Systems
• Pronto: high availability for standard off-the-shelf databases
• A scheme for increasing availability in partitioned replicated databases

Describes a project that uses

Uses Software

• INGRES

This page was built for publication: Achieving graceful performance in distributed error-prone databases

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