关键词: 连续范围查询, 增量式范围查询算法, 扩张树, 组范围查询算法, 路径

Abstract: To solve the problem of continuous range queries for moving objects in road networks, the network distance is adopted as the metric. First, a data storage model is designed for the road networks, the moving objects and the queries in main memory. Next, based on the data model two algorithms are proposed for continuous range queries. The incremental range query algorithm (IRQA) minimizes the re-computation for each query by using the expansion tree and the influence list data structure; however the group range query algorithm (GRQA) achieves the goal through grouping the queries on the same route, making the observation that these queries may share the same execution. Finally, the experimental results show that GRQA has better performance when the queries are centra- lized-distributed, while IRQA is better when queries are uniformly distributed. Meanwhile, they are both more ef-fective than the original brute force algorithm which re-computes each query periodically.

Key words: continuous range query, incremental range query algorithm (IRQA), expansion tree, group range query algorithm (GRQA), route