By Topic

Continuous obstructed range queries in spatio-temporal databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhicheng Li ; School of Computer Science and Technology, Huazhong University of Science and Technology, China ; Yunjun Gao ; Yansheng Lu

In this paper, we study the Continuous Obstructed Range (COR) queries in spatio-temporal databases, which consider the impact of obstacles on the distance between objects. Given a data set P, an obstacle set O, a query point q and a positive value r, a COR query continuously retrieves every point p from P such that the obstructed distance between p and q is less than r, where the obstructed distance is the shortest path between p and q without crossing any obstacle in O. The moving object candidates are divided into several groups according to the obstacles blocking the immediate path from moving objects to query point and the corresponding small local group visibility graphs are constructed. An efficient method is proposed to reduce the time and space costs of computing the obstructed distance. An identification strategy is designed to efficiently process the update of moving objects via directly identifying the qualified objects. Extensive experiments with both real and synthetic data sets demonstrate the efficiency and effectiveness of our proposed algorithm.

Published in:

System Science, Engineering Design and Manufacturing Informatization (ICSEM), 2011 International Conference on  (Volume:2 )

Date of Conference:

22-23 Oct. 2011