Efficient Method for Processing Range Spatial Keyword Queries Over Moving Objects Based on Word2Vec

In this paper, we propose an efficient method for processing continuously range spatial keywords queries based on Word2Vec over moving objects. In particular, the paper addresses two problems of processing range spatial keyword queries over moving objects. Each moving object and query has own keywords and a spatial location information. (i) The likelihood of having similar meanings between the keywords is high, but the likelihood of being exactly the same is low. Therefore, we focus on not only exactly matching, but similarity between keywords through Word2Vec. (ii) Additionally, because the objects are moving, the central server needs to continuously monitor them. In traditional research, by constructing safe region, there are attempts to reduce inevitable communication between the objects and the server. However, the constructions of safe region are also costly. Therefore, in the paper, to decrease communication costs, and construction and maintenance costs, we introduce the concept of buffer region and the pruning rules. Moreover, the proposed method includes a spatial index structure, called the Partition Retrieved list whose role is to help the system quickly construct the safe region of each object. Through experimental evaluations, we verify the effectiveness and efficiency for processing range spatial keyword queries over moving objects.