Reverse K Furthest Neighbors Query Algorithm

With the development of the spatial database, the problem of reverse furthestneighbor query gradually become research hot spot in the field of spatial database query.Reverse furthest neighbor query find these points which take the given query point as theirfurthest neighbor point. It mainly solves that question which find those least influencepoints according to the given query point. This paper discusses the solution of reverse kfurthest neighbors in the European space and network environment.First of all, this paper puts forward reverse k furthest neighbors query algorithm inthe European space. In order to solve the reverse k furthest neighbors query in theEuropean space, we use the filter and refine model. In the filter stage, we come up with theF-TPL pruning technology on the base of TPL pruning technology. Through this pruningtechnology prune the data space in the filter, we can get the query candidate area ofreverse k furthest neighbors. Then we test and verify each point in the candidate area, andget the reverse k furthest neighbors of query point. In the refine, we raise the FRange-kvalidation method on the base of Range-k validation method. In this paper, we put forwardtwo algorithms which can solve the Monochromatic and Bichromatic reverse k furthestneighbors in the European space.Second, we puts forward reverse k furthest neighbors query algorithm under thenetwork environment. Under the network environment, the distance between two points isno longer the shortest distance between two points. So we can't apply the reverse kfurthest neighbors query algorithm in the European space to network environment. And ifwe search the reverse k furthest neighbors directly, it will cost too much to spend. So wechange our angle of thinking, solve this question from another angle. a new solution that isfrom the angle of reverse nearest neighbor query to analysis reverse furthest neighborquery, and translates reverse furthest neighbor query into reverse nearest neighbor query isproposed. And we solve effectively the reverse k furthest neighbors query under thenetwork environment.Finally, the above mentioned two inquire algorithms use respectively real data set and simulation data set to experiment test, the test results show the two inquires the algorithmis effective and practical.