Performace evaluation of furthest k neighbors queries in spatial databases

In this paper we have studied the performance of furthest k neighbors queries for continuous datasets. We compare our proposed efficient grid based algorithm with conceptual partitioning method the only method that can be used to compute furthest neighbor query. Experiments on the real datasets confirm the efficiency and scalability of our proposed algorithm.