DESIGN OF DECOMPOSABLE ALGORITHMS FOR DISTRIBUTED DATABASES
Ahmed M. Khedr · OhioLink ETD Center (Ohio Library and Information Network) · 2003
%" & ' ( )" * ,+ -" ./ 0 & 1 2 43 65 75 78 :9 ; ?3 A@ CB D5 7E GF IH J3 K; 7; L8 M2 N; ?@ ; ?O G8 P RQ TS UQ TV Q XW >Y ZW _ 7'a b>Y dc e ,c >S $>Y d] ?c f hg ji kc >Q l] V 0W 9 7; ?3 A= sr ht jE 4r Ku kr 6r AH 8 MB v; @ st &; ?O G8 9 L8 Mw xE 43 69 78 yH 8 yB z; ?5 {t j@ s9 |; ?O G8 }2 G8 :C9 78 M8 }@ $t | b l .-U 3 6B ); ?O G8 8 :q k= $9 <; H 8 yB z; @ $t r 68 M '; L9 L3 A M= sr h= sB 42 @ CH q IE ; L8 :9 B GC3 AB G8 :8 M9 L3 AB G~ = $B 42 @ CH q IE ; L8 :9 , :3 68 MB 4 :8 @ $t !; ?O G8