| 概率查询及其算法研究 |
| |
| 引用本文： | 李俊丽.概率查询及其算法研究[J].计算机与数字工程,2011,39(2):26-28,51. |
| |
| 作者姓名： | 李俊丽 |
| |
| 作者单位： | 晋中学院计算机科学与技术学院,晋中,030600 |
| |
| 摘 要： | 给出了概率查询的分类,描述了最近邻查询及其基于R-树的深度优先算法,针对此算法的不足,提出了对mindist的改进以完成移动对象的最近邻查询。
|
| 关 键 词： | 概率查询 最近邻查询 距离度量 |
Probabilistic Query and its Algorithm Research |
| |
| Li Junli.Probabilistic Query and its Algorithm Research[J].Computer and Digital Engineering,2011,39(2):26-28,51. |
| |
| Authors: | Li Junli |
| |
| Affiliation: | Li Junli(School of Computer Science and Technology,Jinzhong College,Jinzhong 030600) |
| |
| Abstract: | This paper gives the classification of the probabilistic query,describes the nearest neighbor query and algorithm of R-Tree-Based depth-first.For the shortcomings of this algorithm,an improved mindist is presented to accomplish the nearest neighbor query of moving objects. |
| |
| Keywords: | probabilistic query nearest neighbor query distance measurement |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
