Efficient Filtration and Query Algorithm of Reverse Furthest Neighbor
Reverse furthest neighbor (RFN) is a new issue in the spatial database theory and application. To solve the RFN query efficiently,the corresponding property,theorem and algorithm for computing the candidate filtration points of RFN using the conceptions of the discrete boundary points and neighbor regions are given. Furthermore,the F-RFN query algorithm is proposed with the result of candidate filtration points set. The analyses of the correctness,terminability and the time complexity of the algorithms are also given accordingly. Experimental results indicate that the efficiency of F-RFN query with filtration can be improved about 37% averagely by page access measurement in three typical different data distribution.