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

摘要

Recent years have witnessed the generation of a massive amount of spatial-textual data. In view of this, a new type of query coined spatial keyword query has been proposed to deal with the location-based services with additional keyword constraint. This paper studies one of the most popular spatial keyword queries called Top-k Spatial Keyword Query(TkSKQ). Explicitly speaking, given a set of objects, a TkSKQ finds the k objects that are closest to the querier with each of these k objects satisfying all the keywords specified by the query. This kind of query is of paramount importance in a variety of application domains such as location-based recommendation and advertisement.