On Robustness of B-Trees

Authors:
K. Fujimura;P. Jalote
Affiliations:
-;-
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
1993

Citing 3
Cited 0

Synthesizing Robust Data Structures-An Introduction

IEEE Transactions on Computers
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
A robust B-tree implementation

ICSE '81 Proceedings of the 5th international conference on Software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method is presented to detect index corruption and pointer corruption in B/sup trees. The method uses the semantic information of indices and requires no extra pointers to be added to the data structure. Previous research on the robustness on B-trees has considered index corruption and pointer corruption separately and required extra pointers to be added to the data structure to achieve detectability, and correctability. The proposed method can detect and identify a single semantic or structural error.