A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
A novel query in spatial databases is the K-Best Site Query (KBSQ for short). Given a set of objects O, a set of sites S, and a user-given value K, a KBSQ retrieves the K sites from S such that the total distance from each object to its closest site is minimized. The KBSQ is indeed an important type of spatial queries with many real applications. In this paper, we investigate how to efficiently process the KBSQ. We first propose a straightforward approach with a cost analysis, and then developdoi:10.5121/ijdms.2013.5503 fatcat:3t44bxrwfrcffj254oxm7j7yju