In the procedure of path decomposition and query plan selection, target node in the query tree is utilized to avoid the transfer of the intermediate results.
在路径分解和查询计划选择的过程中，利用查询树中的目标节点来避免中间结果的传递。
To facilitate path expression processing, the processing strategy based on path decomposition and structural join operation needs to be investigated more deeply.
为了加速路径表达式处理，基于路径分解和结构连接操作的处理策略需要更深入的研究。
A kind of time optimal formation strategy is proposed, which is based on path planning and task decomposition as well as an effective algorithm for assignment problem.
针对移动机器人的最速编队问题，结合路径规划和任务分解，提出一种分派问题的新解法和时间最优的编队策略。
应用推荐