Reverse Furthest Neighbors in Spatial Databases

Given a set of points P and a query point q, the reverse furthest neighbor (RFN) query fetches the set of points p P such that q is their furthest neighbor among all points in P {q}. This is the monochromatic RFN (MRFN) query. Another interesting version of RFN query is the bichromatic reverse furthest neighbor (BRFN) query. Given a set of points P, a query set Q and a query point q Q, a BRFN query fetches the set of points p P such that q is the furthest neighbor of p among all points in Q. The RFN query has many interesting applications in spatial databases and beyond. For instance, given a large residential database (as P) and a set of potential sites (as Q) for building a chemical plant complex, the construction site should be selected as the one that has the maximum number of reverse furthest neighbors. This is an instance of the BRFN query. This paper presents the challenges associated with such queries and proposes efficient, R-tree based algorithms for both monochromatic and...

• Type: Conference
• Year: 2009
• Where: ICDE
• Authors: Bin Yao, Feifei Li, Piyush Kumar
• Keywords: Database, Furthest Voronoi Diagrams, ICDE 2009, Query Point, Reverse Furthest Neighbor, Reverse Furthest Neighbors, RFN Query