Be the first to like this
A novel query in spatial databases is the K-Best Si
te Query (KBSQ for short). Given a set of objects O
, a set
of sites S, and a user-given value K, a KBSQ retrie
ves the K sites from S such that the total distance
each object to its closest site is minimized. The K
BSQ is indeed an important type of spatial queries
many real applications. In this paper, we investiga
te how to efficiently process the KBSQ. We first pr
a straightforward approach with a cost analysis, an
d then develop the K Best Site Query (KBSQ) algorit
combined with the existing spatial indexes to impro
ve the performance of processing KBSQ.
Comprehensive experiments are conducted to demonstr
ate the efficiency of the proposed methods.