Similar to relational systems, RTQP provides an algorithm for saving main memory space under the MMDB, and a query optimization integrated the rules in RTDBs and the GAs.
类似于关系系统RTQP提供了在MMDB环境下节省内存的查询处理的实现算法，以及遗传算法和实时数据库规则相结合的查询优化方案。
An approximation algorithm was given to find an out-branching with many leaves in the reduced digraph. Furthermore, some optimization rules were given to improve the out-branching.
对于用近似算法求得的出分枝，又结合前面的规约规则设计了优化规则，以进一步通过优化变换增加出分枝的叶子节点。
Finally, based on the rules and Hungary algorithm, the optimization algorithm is described in detail, which is proven effective by the given example.
最后，基于帮助对象的选取原则和匈牙利算法，对该问题最优化算法进行了具体描述，计算实例表明该算法是有效的。
应用推荐