This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Principles of Data Structure Error Correction
July 1982 (vol. 31 no. 7)
pp. 602-608
D.J. Taylor, Department of Computer Science, University of Waterloo
Error correction in robust data structures is a difficult problem. Several algorithms for correcting structural errors, in certain list and tree structures, are now known. These algorithms have been examined to determine common design features which may prove useful in the design of correction algorithms for other structures. This paper presents a summary of the algorithms studied and the design principles which were derived. The paper is not a "cookbook" for constructing error correction algorithms, but should prove useful to those designing such algorithms. Implications for the design of robust data structures, so that correction may be done easily, are also briefly discussed.
Index Terms:
software fault tolerance, Binary trees, B-trees, error correction, linear lists, redundancy, robust data structures
Citation:
D.J. Taylor, J.P. Black, "Principles of Data Structure Error Correction," IEEE Transactions on Computers, vol. 31, no. 7, pp. 602-608, July 1982, doi:10.1109/TC.1982.1676057
Usage of this product signifies your acceptance of the Terms of Use.