Search operation methods in the relational database machine RINDA

1993 ◽  
Vol 24 (9) ◽  
pp. 1-13
Author(s):  
Haruo Hayami ◽  
Tetsuji Satoh ◽  
Toshio Nakamura ◽  
Junichi Kuroiwa ◽  
Hideaki Takeda
1986 ◽  
pp. 85-126 ◽  
Author(s):  
M. Missikoff ◽  
S. Salza ◽  
M. Terranova

1987 ◽  
Vol 2 (4) ◽  
pp. 265-275 ◽  
Author(s):  
Liming Meng ◽  
Xiaofei Xu ◽  
Huiyou Chang ◽  
Guangxi Chen ◽  
Mingzeng Hu ◽  
...  

1984 ◽  
Vol 2 (2) ◽  
pp. 131-155 ◽  
Author(s):  
Shigeki Shibayama ◽  
Takeo Kakuta ◽  
Nobuyoshi Miyazaki ◽  
Haruo Yokota ◽  
Kunio Murakami

1983 ◽  
Vol 12 (168) ◽  
Author(s):  
Jørgen Staunstrup ◽  
Jens Ove Jespersen ◽  
Ole V. Johansen

<p>By using a multiprocessor to implement the lowest level of a relational database we want to achieve fast execution of database operations such as join, find, and update.</p><p>But the potential speed improvements provided by a multiprocessor can only be achieved if one can construct algorithms and corresponding physical data representations that can utilize the potential.</p><p>By choosing a particular representation, the grid file, and analyzing its behaviour, we want to point out the difficulties encountered in trying to achieve speed improvements from a multiprocessor.</p>


Sign in / Sign up

Export Citation Format

Share Document