摘要
空间连接查询是最耗时、最重要的空间查询 .空间多路连接是涉及多个空间关系的连接查询 .顺序空间连接查询的效率还是不能令人满意 ,研究利用并行机制提高空间连接查询效率成为有吸引力的方向 .并行空间连接处理由三个阶段组成 :任务创建 ,任务分配和任务并行执行 .本文提出一种新的平面扫描方法用于多路并行处理的任务创建过程 .随后提出基于花费估计的动态任务分配策略 ,给出了花费模型 。
One of the most important and time consuming types of query processing in spatial databases is spatial join. Multiway spatial join is the spatial join query which concern several spatial relations. The response time of sequential spatial join is far from meeting the requirements of an interactive user. Researches on improving the efficiency by using parallelism attract increasing interests recently. Generally, parallel spatial processing includes three phases: task creation, task assignment and parallel task execution. In this paper we propose a novel plane sweeping algorithm for task creation of multiway parallel spatial processing. Then, based on cost models for spatial join, a strategy for task assignment is given, and we extend the models for multiway parallel spatial processing to achieve the load balancing.
出处
《小型微型计算机系统》
CSCD
北大核心
2001年第9期1092-1095,共4页
Journal of Chinese Computer Systems
