本文提出了利用关联矩阵进行查询分解优化的具体过程和算法。这种方法极利于在计算机上实现。
The actual procedure and algorithm for query decomposition optimisation with association matrix is proposed, and is convenient to be performed on a computer.
利用Z曲线聚类和降维特性，本文给出网格划分方法、搜索区域分解过程，提出一种高维空间范围查询算法。
Based on Z curve, the paper presents a method of grid partition, a procedure of partitioning search region, and a high-dimensional spatial range query algorithm.
文章提出了一种基于快速分解模拟退火算法的全局查询优化算法。
This paper proposes a global query optimization algorithm based on a faster decomposition-based simulated annealing algorithm.
应用推荐