摘要
针对空间数据库的RkNN查询概念和多个对象的查询特点设计了相关算法.对于一组查询Q,先是生成查询Q的最小圆域DOM(O,R),然后求出RkNN查询的初始化区域,最后通过消除查询错误数据点得到RkNN查询结果.通过对真实数据集进行的大量实验表明,文中提出的算法效率明显优于目前最好的反RkNN算法.
According to the concept of RkNN in the spatial database and the features of RkNN of a Group of object are queried and design the corresponding algorithm.Given a group of nearby space objects as the query input,the author compute the smallest circle enclosing the the query objects,secondly compute the regional of initialization are queried.In the end the author eliminate wrong data to get the query＇s final RkNN query results.A large of experiments according to real data sets,show that the efficiency of the proposed method for RkNN outperform the state-of-the-art algorithm.
出处
《微电子学与计算机》
CSCD
北大核心
2012年第1期18-22,共5页
Microelectronics & Computer
基金
河北省科技支撑计划项目(10213581)
淮安科技计划项目(HAG09061)
