A single quadtree-based algorithm for top-k spatial keyword query

The state-of-art algorithm for processing a TkSKQ is highly sensitive to the number of query keywords specified in the query such that its performance degrades significantly with an increase in the number of keywords. To remedy this drawback, this paper proposes a novel mechanism that utilizes an additional keyword list to enhance the efficiency of the existing solution. Based on this indexing technique, our algorithm needs only traverse a single quadtree when processing a TkSKQ. Moreover, we study how to prioritize the keywords in the vocabulary so as to optimize the performance of our technique. Furthermore, we deal with a generalized version of the TkSKQ problem, called HkSKQ. A similar technique can also be useful for solving HkSKQ. Experimental results on both synthetic and real data reveal the superiority of our proposed scheme.