SPQI: 이동 환경에서 연속 범위 질의에 대한 효율적인 색인 구조

Abstract

In this paper, we explore the efficient processing of continuous range queries over a huge number of moving objects, each of which retrieves the moving objects that are currently located within a geographic query region of interest. The moving objects should continually communicate with the server to report their current locations, so as to keep the results of the continuous range queries up-to-date. However, this increases the server workload and involves a enormous amount of communication as the number of continuous range queries and the moving objects becomes enormous. In this paper, we adopt an approach where we leverage available memory and computational resources of the moving objects in order to resolve these problems. To this end, we propose a query indexing structure, referred to as the Space Partitioning Query Index(SPQI), which enables the server to efficiently cooperate with the moving objects for processing continuous range queries. SPQI improves system performance in terms of server workload and communication cost. Through simulations, we show the superiority of SPQI.