摘要: 基于线段最近邻查询,提出平面曲线的点最近邻查询(LPNN)概念,设计LPNN查询算法。通过R树索引空间对象,采用过滤和精炼两步法提高检索速度。过滤阶段利用平面曲线直接影响区域和筛选规则得到候选对象集,精炼阶段使用优先队列,避免相同点的重复计算,得到平面曲线的点最近邻查询结果。实验结果表明,该算法具有较好的查询性能。
关键词:
最近邻,
索引空间,
R树,
直接影响区域,
优先队列
Abstract: This paper proposes the concept of Line Point Nearest Neighbor(LPNN) query in spatial database on the base of line segment Nearest Neighbor(NN) query and designs the LPNN query algorithms. The algorithm uses filter-refine frame. It filters query data sets by means of the direct influence area of line and choosing rules to reduce search area. It uses priority queue in refinement process for avoiding overlap compute of same point and gets the line point NN query results. Experimental results show that the algorithm has a better query performance.
Key words:
Nearest Neighbor(NN),
index space,
R-tree,
direct influence area,
priority queue
中图分类号:
高峻, 郝忠孝. 空间数据库平面曲线的点最近邻查询[J]. 计算机工程, 2012, 38(15): 46-49.
GAO Jun, HAO Zhong-Xiao. Point Nearest Neighbor Query of Spatial Database Plane Curve[J]. Computer Engineering, 2012, 38(15): 46-49.