Furthest k neighbors queries in spatial databases

Given a set of object O and a query point q, the furthest neighbor query returns an answer set such that the objects in the answer set are far from the query than any other objects in O. In this paper we have studied the furthest k neighbors queries for static and continuous datasets. We propose efficient RTree and grid based algorithms to answer the furthest k neighbors queries. We also define constrained furthest k neighbor query and proposed an algorithm for continuous data set.