Issue No. 03 - June (1993 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.224204
<p>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.</p>
robustness; B-trees; index corruption; pointer corruption; semantic information; data structure; correctability; structural error; tree data structures
P. Jalote and K. Fujimura, "On Robustness of B-Trees," in IEEE Transactions on Knowledge & Data Engineering, vol. 5, no. , pp. 530-534, 1993.