Aggregate keyword routing in spatial database
Kunjie Chen, Weiwei Sun, Chuanchuan Tu, Chunan Chen, Yan Qun Huang · 2012
Due to the proliferation of Location-Based Service and popularity of online geo-tagged web pages, spatial keyword search has attracted significant attention from both academic and industrial communities. In this paper, we study the problem of finding the nearest aggregate point from multiple query points travelling through a set objects described by a given set of keywords, as well as the optimal routes from the query points to the aggregate point. This problem is defined as the Aggregate Keyword Routing (AKR) Query. We devise an exact algorithm to AKR query based on ellipse pruning. Next we propose an efficient approximate algorithm for AKR: Center Based Assignment (CBA). The performance of the proposed algorithms are evaluated with real data, the results demonstrate the efficiency and the effectiveness.