The furthest neighbor query of space K

In the spatial database, the furthest neighbor query is a jumped-up method. If different distances and pruning strategies are properly selected, we can greatly reduce the node number in search space. Through using data cube and edge detection method, we catch up with the traverse pruning method that is based on FNC spatial index tree of incremental and query algorithms. The experimental result turns out that the algorithms have a good pruning effect, at the same time promoting the query efficiency of space k farthest neighbors.