In our method, it is not possible to correct pointer corruption without adding ... Fault-tolerant Computing, Tokyo, Japan, June 1988,194-199. [4] D. Keehn and J.
. I
I
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING,
534
for i = 0 to n.count begin /* n.count is the number of indices in node n */ low = set_low(n,i,low):h i g h = set-high (n.i,high); /* At this point, we update a node along a top-down search path */ ErrorIdentify(Pr, h e i g h t - 1, Zoul, h i g h ) ;
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). -, “Redundancy in data structures: Some theoretical results,” IEEE Trans. Sofrware Eng., vol. 6, pp. 595-4502, Nov. 1980. 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. R. E. Wagner, “Indexing design considerations,” IBM Syst. J . , vol. 12, no. 4, pp. 351-367, 1973. K.Kant and A. Ravichandran, “Synthesizing robust data structure-An introduction,” IEEE Trans. Comput., vol. 39, pp. 161-173, Feb. 1990.
end end /* nonterminal node */ /* Now, the case that n is a terminal node */ if (height error) begin /*Corrupt pointer pointing to
Combining Join and Semi-Join Operations for Distributed Query Processing
the D-part*/ Find node n along the current search path such that height(P,”)
