A FRAMEWORK FOR PROCESSING K-BEST SITE QUERY Yuan-Ko Huang* and Lien-Fa Lin Department of Information Communication Kao-Yuan University; Kaohsiung Country, Taiwan R.O.C. ABSTRACT 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 develop the K Best Site Query (KBSQ) algorithm combined with the existing spatial indexes to improve the performance of processing KBSQ. Comprehensive experiments are conducted to demonstrate the efficiency of the proposed methods. KEYWORDS spatial databases; K-Best Site Query; spatial indexes Ful...
