With the popularization of GPS-enabled devices and the arrival of the big data era, a significant amount of spatial documents have been generated every day. This development gives prominence to spatial keyword queries (SKQ), which consider both the distance and the keyword similarity of objects. However, Most of the existing SKQ methods are limited in Euclidean space which are unsuitable for SKQ processing in road networks. The paper addresses the issue of processing continuous spatial keyword range queries over moving objects (CMRSK) in road networks where both the query point and data objects can freely move within the road network. By using a range tree to bound the monitoring region of a CMRSK query, an efficient query processing method is proposed. Finally, simulation experiments are conducted to demonstrate the efficiency of our proposed method.
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications