A robust B-tree implementation

Authors:
J. P. Black;D. J. Taylor;D. E. Morgan
Affiliations:
-;-;-
Venue:
ICSE '81 Proceedings of the 5th international conference on Software engineering
Year:
1981

Citing 2
Cited 4

Software reliability: The role of programmed exception handling

Proceedings of an ACM conference on Language design for reliable software
Robust data structure implementations for software reliability.

Robust data structure implementations for software reliability.

Robust Storage Structures for Crash Recovery

IEEE Transactions on Computers - The MIT Press scientific computation series
Local Concurrent Error Detection and Correction in Data Structures Using Virtual Backpointers

IEEE Transactions on Computers
On Robustness of B-Trees

IEEE Transactions on Knowledge and Data Engineering
Principles of Data Structure Error Correction

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

A storage structure for B-trees is presented which is robust in that any pair of changes to structural fields of an instance of the structure can be detected, as well as many sets of larger numbers of changes. Included in the paper are a motivation for robustness as a design criterion, cost and performance implications of the B-tree implementation, and a solution to the subproblem of a robust implementation for each node's contiguous list of pointers and keys.