计算机工程2017，Vol.43Issue(4)：234-238,5.DOI:10.3969/j.issn.1000-3428.2017.04.040
基于改进Metric索引的反向最远邻查询方法
Reverse Furthest Neighbor Query Method Based on Improved Metric Index
摘要
Abstract
When using PIV algorithm to build a Metric index,it is needed to calculate the distance between the convex hull vertices and all the data points in the convex hull.When the data set is large,this wastes storage space and increases the consumption of query.In order to solve this problem,this paper improves Metric index so that only the distance between the convex hull vertices and part of the data points within the convex hull is stored,and puts forward a method using the distance between the point of convex hull and the convex hull vertices to judge whether the point is the query result.Test results show that compared with the PIV algorithm,the proposed method can get the correct results of reverse furthest neighbor query,reduce the amount of storage space and query consumption,and improve the query efficiency.关键词
空间数据库/反向最远邻/Metric索引/凸包/半平面修剪策略Key words
spatial database/reverse furthest neighbor/Metric index/convex hull/half plane pruning strategy分类
信息技术与安全科学引用本文复制引用
杨秀娟,董军,李慧慧,袁延忠,陈晓丹..基于改进Metric索引的反向最远邻查询方法[J].计算机工程,2017,43(4):234-238,5.基金项目
黑龙江省教育厅科学技术研究项目(12541731). （12541731）
