Title :
On robustness of B-trees
Author :
FujiMura, Kikuo ; Jalote, Pankaj
Author_Institution :
Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA
fDate :
6/1/1993 12:00:00 AM
Abstract :
A method is presented to detect index corruption and pointer corruption in B+-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
Keywords :
tree data structures; B-trees; correctability; data structure; index corruption; pointer corruption; robustness; semantic information; structural error; Computer crashes; Computer science; Data structures; Error correction; Information retrieval; Information science; Protection; Redundancy; Robustness;
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
