SPQI: An Efficient Index for Continuous Range Queries in Mobile Environments

Citations

WEB OF SCIENCE

4
Citations

SCOPUS

8

초록

This paper explores the problem of efficient processing of continuous range queries (CRQs) over a large number of moving objects, each of which continually retrieves the moving objects that are currently within a geographic query region of interest. In order to keep the result of CRQs up-to-date, the moving objects should continually communicate with the server to report their current locations. However, this increases the server workload and entails a huge amount of communication cost when the number of the moving objects and CRQs becomes enormous. In this paper, we adopt the approach of leveraging available memory and computational resources of the moving objects to remedy such problems. To this end, we propose a novel 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 CRQs. SPQI greatly improves the overall system performance in terms of server workload and communication cost. Through a set of comprehensive simulations, we verify the superiority of SPQI.

키워드

continuous range queriesmoving objectsquery indexing structureslocation based servicesmobile computingubiquitous computingMONITORING QUERIES
제목
SPQI: An Efficient Index for Continuous Range Queries in Mobile Environments
저자
Jung, HaRimKim, Yong SungChung, Yon Dohn
발행일
2013-05
유형
Article
저널명
Journal of Information Science and Engineering
29
3
페이지
557 ~ 578