| 多路R树连接的加权处理 |
| |
| 引用本文： | 姜素芳,陈天滋.多路R树连接的加权处理[J].计算机工程与应用,2006,42(31):174-178. |
| |
| 作者姓名： | 姜素芳 陈天滋 |
| |
| 作者单位： | 江苏大学,计算机科学与通信工程学院,江苏,镇江,212013 |
| |
| 摘 要： | 空间连接运算是空间数据查询中最重要、最耗时的基本操作之一,其中基于R树的空间连接(RJ)被认为是一种高效的处理机制,但在空间连接的精化阶段处理复杂的空间数据时需要很大的系统开销。基于MBR及直接查询谓词,提出了一种加权处理方法,并扩展了R树结构及MRJ算法。从而优化了多路R树连接的筛选处理,能得到更加有效的候选集;同时,减少了磁盘访问次数,可节省CPU及I/O的时间开销。还通过应用实例验证了其在空间数据库查询优化方面的优势。
|
| 关 键 词： | 空间连接 多路R树连接 派生谓词 查询图 加权处理 |
| 文章编号： | 1002-8331（2006）31-0174-05 |
| 收稿时间： | 2006-01 |
| 修稿时间： | 2006-01 |
Weighted Processing of Multi-way R-tree Join |
| |
| JIANG Su-fang,CHEN Tian-zi.Weighted Processing of Multi-way R-tree Join[J].Computer Engineering and Applications,2006,42(31):174-178. |
| |
| Authors: | JIANG Su-fang CHEN Tian-zi |
| |
| Affiliation: | School of Computer Science and Telecommunications Engineering, Jiangsu University,Zhenjiang,Jiangsu 212013,China |
| |
| Abstract: | Spatial join is the most important and time-consumed in spatial query of SDBMS,R-tree based spatial join is always considered as a kind of high efficient processing mechanism.In the refinement step of spatial join,it needs a lot of system overhead to process complex spatial data.This paper based on the MBR and the direct query predicate proposes a method to generate a weighted complete query graph and extends the structure of R-tree and the MRJ algorithm which mainly contributes to optimize the filter step of the multi-way R-tree join to get a set of more effective candidates and then reduce the frequency of disk access and the overhead of CPU as well as I/O.Through the experiment of specific application by using this method,we show the significant superiority in optimizing the spatial query of SDBMS. |
| |
| Keywords: | spatial join multi-way R-tree join derived predicate query graph weighted processing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
