
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
A novel query in spatial databases is the KBest Si
te Query (KBSQ for short). Given a set of objects O
, a set
of sites S, and a usergiven value K, a KBSQ retrie
ves the K sites from S such that the total distance
from
each object to its closest site is minimized. The K
BSQ is indeed an important type of spatial queries
with
many real applications. In this paper, we investiga
te how to efficiently process the KBSQ. We first pr
opose
a straightforward approach with a cost analysis, an
d then develop the K Best Site Query (KBSQ) algorit
hm
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.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment