摘要
反最近邻查询是在最近邻查询基础上提出的一种新的查询类型,是空间数据库的应用拓展,在不同维数下,根据不同的索引结构,反映出空间对象的反最近邻查询差异性较大,从不同索引结构的特性出发,分析了低维环境丁基于R*-树的反最近邻查询优势,提出高维环境下一种新的基于SRdann-树索引结构的空间对象反最近查询方法,优化了不同维数下空间对象的反最近查询性能,提高了查询效率.
The reverse nearest neighbor query is a new kind query based on the nearest neighbor query, it is application extention on spatial database. Under different dimensions, different index structure, it indicates great differences of the reverse neighbor query about spatial abjects. This paper from the features of different index structure analyzes the reverse nearest neighbor query superiorities under low dimension based on R^*- tree and puts forward a new kind reverse nearest neighbor query method about spatial objects under high dimension based on SRdnn- tree index struture, to optimize the reverse nearest neighbor query performancer about spatial objects under different dimensions, to improve the query efficiencies.
出处
《湖南城市学院学报(自然科学版)》
CAS
2007年第1期70-72,共3页
Journal of Hunan City University:Natural Science
基金
湖南省教育厅科研基金资助项目(05C719)
湖南文理学院硕士科研基金资助项目(JJQD06127)