Robust Storage Structures for Crash Recovery

Authors:
John J. Tayloy;Carl-Johan H. Seger
Affiliations:
Univ. of Waterloo, Waterloo, Ontario, Canada;Univ. of Waterloo, Waterloo, Ontario, Canada
Venue:
IEEE Transactions on Computers - The MIT Press scientific computation series
Year:
1986

Citing 7
Cited 6

A Survey of Techniques for Synchronization and Recovery in Decentralized Computer Systems

ACM Computing Surveys (CSUR)
Information Retrieval: Recovery of disk contents after system failure

Communications of the ACM
A robust B-tree implementation

ICSE '81 Proceedings of the 5th international conference on Software engineering
Robust data structure implementations for software reliability.

Robust data structure implementations for software reliability.
A crash tolerant b-tree data structure for database retrieval systems

A crash tolerant b-tree data structure for database retrieval systems
Principles of Data Structure Error Correction

IEEE Transactions on Computers
Redundancy in Data Structures: Improving Software Fault Tolerance

IEEE Transactions on Software Engineering

Local Correction of Helix(k) Lists

IEEE Transactions on Computers
A Checkpointing Page Store for Write-Once Optical Disk

IEEE Transactions on Computers
Resourceful systems for fault tolerance, reliability, and safety

ACM Computing Surveys (CSUR)
Design of Multi-Invariant Data Structures for Robust Shared Accesses in Multiprocessor Systems

IEEE Transactions on Software Engineering
Implementation and performance assessment of multilevel data structures

COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Evaluating the recovery-oriented approach through the systematic development of real complex applications

Software—Practice & Experience

Quantified Score

Hi-index	0.01

Visualization

Abstract

A robust storage structure is intended to provide the ability to detect and possibly correct damage to the structure. One possible source of damage is the partial completion of an update operation, due to a "crash" of the program or system performing the update. Since adding redundancy to a structure increases the number of fields which must be changed, it is not clear whether adding redundancy will help or hinder crash recovery. This paper examines some of the general principles of using robust storage structures for crash recovery. It also describes a particular class of linked list structures which can be made arbitrarily robust, and which are all suitable for crash recovery.