Constrained range search query processing on road networks

Authors:
Kefeng Xuan;Geng Zhao;David Taniar;Maytham Safar;Bala Srinivasan
Affiliations:
Clayton School of Information Technology, Monash University, Melbourne, Australia;Clayton School of Information Technology, Monash University, Melbourne, Australia;Clayton School of Information Technology, Monash University, Melbourne, Australia;Computer Engineering Department, Kuwait University, Kuwait;Clayton School of Information Technology, Monash University, Melbourne, Australia
Venue:
Concurrency and Computation: Practice & Experience
Year:
2011

Citing 0
Cited 6

The smart-travel system: utilising cloud services to aid traveller with personalised requirement

International Journal of Web and Grid Services
Designing an integrated driver assistance system using image sensors

Journal of Intelligent Manufacturing
An efficient algorithm for computing safe exit points of moving range queries in directed road networks

Information Systems
Modelling spatio-temporal relevancy in urban context-aware pervasive systems using voronoi continuous range query and multi-interval algebra

Mobile Information Systems
A distributed approach to continuous monitoring of constrained k-nearest neighbor queries in road networks

Mobile Information Systems
A safe exit algorithm for continuous nearest neighbor monitoring in road networks

Mobile Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Range search is one of the most common queries in the spatial databases and geographic information systems (GIS). Most range search processing depends on the length of the distance that expresses the relative position of the objects of interest in the Euclidean space or road networks. But, in reality, the expected result is normally constrained by other factors (e.g. number of spatial objects, pre-defined area, and so forth.) rather than the distance alone; hence, range search should be comprehensively discussed in various scenarios. In this paper, we propose two constrained range search approaches based on network Voronoi diagram, namely Region Constrained Range (RCR) and k nearest neighbor Constrained Range (kCR), which make the range search query processing more flexible to satisfy different requirements in a complex environment. The performance of these approaches is analyzed and evaluated to illustrate that both of them can process constrained range search queries very efficiently. Copyright © 2010 John Wiley & Sons, Ltd.