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 为了解决各种优化计算问题,人们提出了各种各样的优化计算方法,如单纯形法、梯度法、动态规划法、分枝剪界法。这些优化算法各有各的长处,各有各的适用范围,也有各自的限制。
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 另外,本文还总结了几种基于r树索引的空间连接算法及其代价评估模型,利用动态编程算法给出了查询优化的算法框架,并在sadbs中集成了基本的r树索引方法和查询优化机制。