| 近似查询中重叠区域的扫描计算 |
| |
| 引用本文： | 李博涵,郝忠孝. 近似查询中重叠区域的扫描计算[J]. 计算机工程, 2008, 34(13): 10-12 |
| |
| 作者姓名： | 李博涵 郝忠孝 |
| |
| 作者单位： | 哈尔滨理工大学计算机科学与技术学院,哈尔滨,150080;哈尔滨理工大学计算机科学与技术学院,哈尔滨,150080;齐齐哈尔大学计算机与控制工程学院,齐齐哈尔,161006;哈尔滨工业大学计算机科学与技术学院,哈尔滨,150001 |
| |
| 摘 要： | 根据R*树节点硬盘主引导记录(MBR)特征，在不改变最小外包矩形特征的前提下，通过区域扫描对正交MBR重叠区域边界建立二叉线段树，以此为基础分别计算面积和周长，有效改善了R*树节点结构。理论分析和实验均表明，与未经过重叠区域计算的R*树相比，经计算的R*树节点比较次数平均下降了近60%，准确率提高了约60%。
|
| 关 键 词： | 近似查询 硬盘主引导记录 重叠区域 R*树 |
| 修稿时间： | |
Sweeping Calculation of Overlapping Region in Approximate Search |
| |
| LI Bo-han,HAO Zhong-xiao. Sweeping Calculation of Overlapping Region in Approximate Search[J]. Computer Engineering, 2008, 34(13): 10-12 |
| |
| Authors: | LI Bo-han HAO Zhong-xiao |
| |
| Affiliation: | (1. School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080; 2. School of Computer and Control Engineering, Qiqihar University, Qiqihar 161006; 3. School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001) |
| |
| Abstract: | According to the characteristics of Master Boot Record(MBR) in R*-tree, this paper creates the binary segment tree by sweeping the orthogonal overlapping region. Sweeping algorithm calculates the area and perimeter of the orthogonal overlapping region without changing the characteristics of the minimum bounding rectangle. Comparison of the evaluation reveals that the number of node access of R*-tree decreases by nearly 60 percent and the search accuracy increases by about 60 percent after calculating the overlapping compared with the algorithm uncalculated. Analysis and experimental results show that the algorithm can improve the accuracy and efficiency of route selection with inserting large amount of the spatial objects in approximate search by calculating the overlapping in advance. |
| |
| Keywords: | approximate search Master Boot Record(MBR) overlapping region R*-tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
|
