DocumentCode
924793
Title
On robustness of B-trees
Author
FujiMura, Kikuo ; Jalote, Pankaj
Author_Institution
Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA
Volume
5
Issue
3
fYear
1993
fDate
6/1/1993 12:00:00 AM
Firstpage
530
Lastpage
534
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;
fLanguage
English
Journal_Title
Knowledge and Data Engineering, IEEE Transactions on
Publisher
ieee
ISSN
1041-4347
Type
jour
DOI
10.1109/69.224204
Filename
224204
Link To Document