Continuous range search based on network Voronoi diagram

Authors:
Kefeng Xuan;Geng Zhao;David Taniar;Bala Srinivasan;Maytham Safar;Marina Gavrilova
Affiliations:
Clayton School of Information Technology, Monash University, Australia.;Clayton School of Information Technology, Monash University, Australia.;Clayton School of Information Technology, Monash University, Australia.;Clayton School of Information Technology, Monash University, Australia.;Department of Computer Engineering, Kuwait University, Kuwait.;Department of Computer Science, University of Calgary, Calgary, Canada
Venue:
International Journal of Grid and Utility Computing
Year:
2009

Citing 16
Cited 3

Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Optimal multi-step k-nearest neighbor search

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Swap conditions for dynamic Voronoi diagrams for circles and line segments

Computer Aided Geometric Design
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean d-dimensional space

Computer Aided Geometric Design
A Taxonomy of Broadcast Indexing Schemes for Multi Channel Data Dissemination in Mobile Databases

AINA '04 Proceedings of the 18th International Conference on Advanced Information Networking and Applications - Volume 2
Alternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Network Databases

Geoinformatica
Research in mobile database query optimization and processing

Mobile Information Systems
K nearest neighbor search in navigation systems

Mobile Information Systems
When location-based services meet databases

Mobile Information Systems
Continuous nearest neighbor search

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Query processing in spatial network databases

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A context-aware Tour Guide: User implications

Mobile Information Systems
Continuous Range Search Query Processing in Mobile Navigation

ICPADS '08 Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems

Voronoi-based multi-level range search in mobile navigation

Multimedia Tools and Applications
Optimized skyline queries on road networks using nearest neighbors

Personal and Ubiquitous Computing
Probabilistic Voronoi diagrams for probabilistic moving nearest neighbor queries

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to the boom of GIS and GPS, various queries in spatial and mobile database become hot spot issues nowadays, typically, range search and k nearest neighbour queries. Both problems have undergone extensive development for many years, from focusing on the Euclidean distance to network distance, and from dealing with static objects to moving objects. In every step forward, there have been many literature reports, but only a few have dealt with Continuous Range Search (CRS) query processing. Even though the existing approach to CRS has an acceptable performance, it is still impractical because the query path needs to be segmented. In this paper, we propose a new approach based on network Voronoi diagram for range search, where the query path does not need to be segmented.