引用本文: | 廖巍,吴秋云,陈宏盛,等.基于扩展时空距离度量的连续k近邻查询方法[J].国防科技大学学报,2007,29(1):81-85.[点击复制] |
LIAO Wei,WU Qiuyun,CHEN Hongsheng,et al.Continuous k-nearest Neighbor Queries Based on Extended Spatio-temporal Distance Metrics[J].Journal of National University of Defense Technology,2007,29(1):81-85[点击复制] |
|
|
|
本文已被:浏览 5674次 下载 4457次 |
基于扩展时空距离度量的连续k近邻查询方法 |
廖巍, 吴秋云, 陈宏盛, 景宁, 钟志农 |
(国防科技大学 电子科学与工程学院,湖南 长沙 410073)
|
摘要: |
针对基于TPR树索引的连续 k近邻查询,引入了一种新的时空距离度量最小最大距离函数作为TPR树索引搜索时节点剪枝上界。提出了一种采用最优优先策略的基于扩展时空距离度量的连续k近邻查询STM-CNN算法,利用最小距离函数进行TPR树索引节点搜索时访问排序,并使用最小最大距离函数对TPR树索引进行剪枝界定。 |
关键词: 连续 k近邻查询 TPR树 最小最大距离函数 STM-CNN算法 |
DOI: |
投稿日期:2006-05-16 |
基金项目:国家自然科学基金资助项目(60472031) |
|
Continuous k-nearest Neighbor Queries Based on Extended Spatio-temporal Distance Metrics |
LIAO Wei, WU Qiuyun, CHEN Hongsheng, JING Ning, ZHONG Zhinong |
(College of Electronic Science and Engineering , National Univ. of Defense Technology, Changsha 410073,China)
|
Abstract: |
In order to process CKNN queries on the basis of TPR-tree efficiently, a new spatio-temporal distance metrics minmaxdist(t) was presented as a pruning upper bound. Also a CKNN queries algorithm STM-CNN which can search in best-first manner was developed by means of mindist(t) and minmaxdist(t) metrics, in which STM-CNN algorithm visits TPR-tree nodes according to mindist(t)order, and pruning the nodes with minmaxdist(t). |
Keywords: CKNN queries TPR-tree minmaxdist(t) STM-CNN algorithm |
|
|
|
|
|