This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Synthesizing Robust Data Structures-An Introduction
February 1990 (vol. 39 no. 2)
pp. 161-173

A formal approach is presented for the analysis and synthesis of robust data structures. The entire data structure is viewed as a collection of data elements related via some attributes. The relationships are specified by a set of axioms in first-order logic. Faults in attributes invalidate some of the axioms. The invalidated axioms are used to detect and correct the faulty attributes. The authors show how detection and correction can be localized to small portions of the data structure, thereby allowing concurrent repair in several disjoint portions. This property makes local correction attractive for B-trees and other structures used in databases. They then show how the ideas developed for attaining structural integrity can be applied to achieve data integrity as well.

[1] A. Avizienis, "TheN-version approach to fault tolerant software,"IEEE Trans. Software Eng., vol. SE-11, no. 12, pp. 1491-1501, Dec. 1985.
[2] I. J. Davis, "A locally correctable AVL tree," inProc. FTCS-17, July 6-8, 1987, pp. 85-88.
[3] K. Kant and A. Ravichandran, "Synthesizing robust data structures--A formal approach," Tech. Rep., Pennsylvania State Univ., 1988.
[4] P. L. Lehman and S. B. Yao, "Efficient locking for concurrent operations on B-trees,"ACM Trans. Database Syst., vol. 6, pp. 650- 670, Dec. 1981.
[5] R. Reiter, "A theory of diagnosis from first principles,"Artif. Intell., vol. 32, pp. 57-95, 1987.
[6] A. Ravichandran and K. Kant, "Correction algorithms for robust data structures,"Inform. Sci., to be published.
[7] S. C. Seth and R. Muralidhar, "Analysis and design of robust data structures," inDig. FTCS-15, June 1985, pp. 14-19.
[8] M. C. Sampaio and J. P. Sauve, "Robust trees," inDig. FTCS-15, June 19-21, 1985, pp. 23-28.
[9] D. J. Taylor and J. P. Black, "Guidelines for storage structure error correction," inDig. FTCS-15, June 19-21, 1985, pp. 20-22.
[10] D. J. Taylor and J. P. Black, Locally correctableB-tree implementation,"Comput. J., vol. 24, no. 3, 1986.
[11] D. J. Taylor, J. P. Black, and D. E. Morgan, "Redundancy in data structures: Improving software fault tolerance,"IEEE Trans. Software Eng., vol. SE-6, no. 6, pp. 585-594, Nov. 1980.

Index Terms:
formal approach; synthesis; robust data structures; data elements; attributes; first-order logic; axioms; concurrent repair; disjoint portions; B-trees; databases; data structures; fault tolerant computing; trees (mathematics).
Citation:
K. Kant, A. Ravichandran, "Synthesizing Robust Data Structures-An Introduction," IEEE Transactions on Computers, vol. 39, no. 2, pp. 161-173, Feb. 1990, doi:10.1109/12.45202
Usage of this product signifies your acceptance of the Terms of Use.