摘要
空间数据库中反最近邻查询的研究是空间查询的研究热点。在对现有的反最近邻查询技术进行分析比较的基础上,针对提高动态数据集的查询效率问题,给出了基于R树索引结构的反最近邻查询方案。通过实验结果的分析比较,可以看出该方案能够有效地解决动态数据集的查询问题。
Reverse nearest neighbor spatial database query of spatial query is a research hotspot.Based on the analysis and comparison of the existing reverse nearest neighbor query technology,towards the query efficiency improvement of dynamic data set,a new reverse nearest neighbor query method is proposed based on the R-tree index structure.Comparison and analysis of experiment results show that the program can effectively solve the problem of dynamic data set query.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第33期146-148,共3页
Computer Engineering and Applications
关键词
空间数据库
反最近邻查询
索引结构
spatial databases
reverse nearest neighbor query
index structure
