Title :
Optimal buffer partitioning for the nested block join algorithm
Author :
Wolf, Joel L. ; Iyer, B.R. ; Pattipati, Krishna R. ; Turek, John
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Abstract :
An efficient, exact algorithm is developed for optimizing the performance of nested block joins. The method uses both dynamic programming and branch-and-bound. In the process of deriving the algorithm, the class of resource allocation problems for which the greedy algorithm applies has been extended. Experiments with this algorithm on extremely large problems show that it is superior to all other known algorithms by a wide margin
Keywords :
dynamic programming; relational databases; branch-and-bound; dynamic programming; greedy algorithm; nested block join algorithm; optimal buffer partitioning; performance optimisation; resource allocation; Dynamic programming; Greedy algorithms; Heuristic algorithms; Optimization methods; Partitioning algorithms; Prototypes; Query processing; Resource management; Size measurement; Systems engineering and theory;
Conference_Titel :
Data Engineering, 1991. Proceedings. Seventh International Conference on
Conference_Location :
Kobe
Print_ISBN :
0-8186-2138-9
DOI :
10.1109/ICDE.1991.131500
