| 局部范围受限的多类型最近邻查询 |
| |
| 引用本文： | 孙冬璞,郝忠孝.局部范围受限的多类型最近邻查询[J].计算机研究与发展,2009,46(6). |
| |
| 作者姓名： | 孙冬璞 郝忠孝 |
| |
| 作者单位： | 1. 哈尔滨理丁大学计算机科学与技术学院,哈尔滨,150080
2. 哈尔滨理丁大学计算机科学与技术学院,哈尔滨,150080;哈尔滨工业大学计算机科学与技术学院,哈尔滨,150001 |
| |
| 基金项目： | 黑龙江省自然科学基金 |
| |
| 摘 要： | 多类型最近邻查询在现实中的应用范围比传统的最近邻查询广泛.基于多类型最近邻查询,提出局部范围受限的多类型最近邻查询(PCMTNN)概念,针对范围约束是任意简单多边形区域的数据集给出PCMTNN算法,利用椭圆最小外切矩形的易求性和与椭圆本身覆盖区域的最近似性特点缩小了搜索范围,并用一个链表结构实现了在一次R树的遍历过程中找到包含在所有搜索区域内的数据集中点的过程,从而大幅度减少了无用点的访问数量.实验结果分析表明算法具有较好的性能.
|
| 关 键 词： | 多类型最近邻查询 简单多边形 PCMTNN算法 椭圆最小外切矩形 链表结构 |
Multi-Type Nearest Neighbor Queries with Partial Range Constrained |
| |
| Sun Dongpu,Hao Zhongxiao.Multi-Type Nearest Neighbor Queries with Partial Range Constrained[J].Journal of Computer Research and Development,2009,46(6). |
| |
| Authors: | Sun Dongpu Hao Zhongxiao |
| |
| Affiliation: | College of Computer Science and Technology;Harbin University of Science and Technology;Harbin 150080;College of Computer Science and Technology;Harbin Institute of Technology;Harbin 150001 |
| |
| Abstract: | Multi-type nearest neighbor (MTNN) query is used in real-life applications more widely than the traditional nearest neighbor query. The concept of multi-type nearest neighbor query with partial range constrained (PCMTNN) is put forward,and the PCMTNN algorithm is proposed,which aims at the ranges constrained with arbitrary simple polygons. The range queries are used to get the qualified points among the datasets that have the constrained ranges; and then,the rest datasets and the new datasets which contain ... |
| |
| Keywords: | multi-type nearest neighbor query simple polygon PCMTNN algorithm minimal circumscribed rectangle of an ellipse list structure |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
