This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Robustness of B-Trees
June 1993 (vol. 5 no. 3)
pp. 530-534
ASCII Text
x 
 
K. Fujimura, P. Jalote, "On Robustness of B-Trees," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 3, pp. 530-534, June, 1993.
 
 
BibTex
x
 
@article{ 10.1109/69.224204,
author = {K. Fujimura and P. Jalote},
title = {On Robustness of B-Trees},
journal ={IEEE Transactions on Knowledge and Data Engineering},
volume = {5},
number = {3},
issn = {1041-4347},
year = {1993},
pages = {530-534},
doi = {http://doi.ieeecomputersociety.org/10.1109/69.224204},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Knowledge and Data Engineering
TI - On Robustness of B-Trees
IS - 3
SN - 1041-4347
SP530
EP534
EPD - 530-534
A1 - K. Fujimura,
A1 - P. Jalote,
PY - 1993
KW - robustness; B-trees; index corruption; pointer corruption; semantic information; data structure; correctability; structural error; tree data structures
VL - 5
JA - IEEE Transactions on Knowledge and Data Engineering
ER -
 

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.

[1] J. P. Black, D. J. Taylor and D. E. Morgan, "A robust B-tree implementation,"Proc. Int. Conf. Software Eng., Mar. 1981, 63-70.
[2] C. Comer, "The ubiquitousB-trees,"ACM Comput. Surveys, vol. 11, no. 2, pp. 121-136, June 1979.
[3] K. Fujimura and P. Jalote, Robust search methods in B-trees,Proc. 18th Int. Symp. Fault-tolerant Computing, Tokyo, Japan, June 1988, 194-199.
[4] D. Keehn and J. Lacy, "VSAM data set design parameters,"IBM Syst. J., vol. 3, pp. 186-212, 1974.
[5] M. C. Sampaio and J. P. Sauve, "Robust trees,"Proc. 15th Int. Symp. Fault-Tolerant Computing, Ann Arbor, MI, June 1985, pp. 42-47.
[6] S. C. Seth and R. Muralidhar, "Analysis and design of robust data structures,"Proc. 15th Int. Symp. Fault-Tolerant Computing, Ann Arbor, MI, June 1985, pp. 14-19.
[7] D. J. Taylor, D. E. Morgan, and J. P. Black, "Redundancy in data structures: Improving software fault tolerance,"IEEE Trans. Software Eng., vol. 6, pp. 585-594, Nov. 1980).
[8] D. J. Taylor, D. E. Morgan, and J. P. Black, "Redundancy in data structures: Some theoretical results,"IEEE Trans. Software Eng., vol. 6, pp. 595-402, Nov. 1980.
[9] D. J. Taylor and J. P. Black, "A locally correctable B-tree implementation,"The Comput. J., vol. 29, no. 3, pp. 269-276, June 1986.
[10] R. E. Wagner, "Indexing design considerations,"IBM Syst. J., vol. 12, no. 4, pp. 351-367, 1973.
[11] K. Kant and A. Ravichandran, "Synthesizing robust data structure-An introduction,"IEEE Trans. Comput., vol. 39, pp. 161-173, Feb. 1990.

Index Terms:
robustness; B-trees; index corruption; pointer corruption; semantic information; data structure; correctability; structural error; tree data structures
Citation:
K. Fujimura, P. Jalote, "On Robustness of B-Trees," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 3, pp. 530-534, June 1993, doi:10.1109/69.224204
Usage of this product signifies your acceptance of the Terms of Use.