So a lot of researchers have attached importance to optimization computing , and put forward all kinds of algotithms for optimization problems , for instance : simplex algorithm , dynamic programming algorithm , branch - bound algorithm , etc . but these algorithms are all disadvantage and can not be applied to complex nonlinear optimization problems 為了解決各種優(yōu)化計(jì)算問(wèn)題,人們提出了各種各樣的優(yōu)化計(jì)算方法,如單純形法、梯度法、動(dòng)態(tài)規(guī)劃法、分枝剪界法。這些優(yōu)化算法各有各的長(zhǎng)處,各有各的適用范圍,也有各自的限制。
In addition , we summarize some spatial join algorithms based on r - tree index and their cost estimation models . we also give out a query optimization algorithm framework based on dynamic programming algorithm , and integrated basic r - tree index method and query optimization mechanism into sadbs ii 另外,本文還總結(jié)了幾種基于r樹(shù)索引的空間連接算法及其代價(jià)評(píng)估模型,利用動(dòng)態(tài)編程算法給出了查詢優(yōu)化的算法框架,并在sadbs中集成了基本的r樹(shù)索引方法和查詢優(yōu)化機(jī)制。