VGQ-Vor: extending virtual grid quadtree with Voronoi diagram for mobile k nearest neighbor queries over mobile objects

Authors:
Botao Wang;Jingwei Qu;Xiaosong Wang;Guoren Wang;Masaru Kitsuregawa
Affiliations:
Department of Information Science and Engineering, Northeastern University, Shenyang, China 110004;Department of Information Science and Engineering, Northeastern University, Shenyang, China 110004;Department of Information Science and Engineering, Northeastern University, Shenyang, China 110004;Department of Information Science and Engineering, Northeastern University, Shenyang, China 110004;Institute of Industrial Science, the University of Tokyo, Tokyo, Japan 153-8505
Venue:
Frontiers of Computer Science: Selected Publications from Chinese Universities
Year:
2013

Citing 29
Cited 0

R-trees: a dynamic index structure for spatial searching

Readings in database systems
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
Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A Framework for Generating Network-Based Moving Objects

Geoinformatica
Evaluating Top-k Selection Queries

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
K-Nearest Neighbor Search for Moving Query Point

SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Main Memory Evaluation of Monitoring Queries Over Moving Objects

Distributed and Parallel Databases
STRIPES: an efficient index for predicted trajectories

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Monitoring k-Nearest Neighbor Queries over Moving Objects

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
R-trees with Update Memos

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Continuous nearest neighbor monitoring in road networks

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Continuous nearest neighbor search

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The TPR*-tree: an optimized spatio-temporal access method for predictive queries

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Query and update efficient B+-tree based indexing of moving objects

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
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
ST2B-tree: a self-tunable spatio-temporal b+-tree index for moving objects

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Primal or dual: which promises faster spatiotemporal search?

The VLDB Journal — The International Journal on Very Large Data Bases
The V*-Diagram: a query-dependent approach to moving KNN queries

Proceedings of the VLDB Endowment
A benchmark for evaluating moving object indexes

Proceedings of the VLDB Endowment
The RUM-tree: supporting frequent updates in R-trees using memos

The VLDB Journal — The International Journal on Very Large Data Bases
Monitoring path nearest neighbor in road networks

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Optimized algorithms for predictive range and KNN queries on moving objects

Information Systems
Efficient k-nearest neighbor search on moving object trajectories

The VLDB Journal — The International Journal on Very Large Data Bases
VoR-tree: R-trees with Voronoi diagrams for efficient processing of spatial nearest neighbor queries

Proceedings of the VLDB Endowment
Probabilistic range queries for uncertain trajectories on road networks

Proceedings of the 14th International Conference on Extending Database Technology
Vague continuous K-nearest neighbor queries over moving objects with uncertain velocity in road networks

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Performing mobile k nearest neighbor (MkNN) queries whilst also being mobile is a challenging problem. All the mobile objects issuing queries and/or being queried aremobile. The performance of this kind of query relies heavily on the maintenance of the current locations of the objects. The index used for mobile objects must support efficient update operations and efficient query handling. This study aims to improve the performance of the MkNN queries while reducing update costs. Our approach is based on an observation that the frequency of one region changing between being occupied or not by mobile objects is much lower than the frequency of the position changes reported by the mobile objects. We first propose an virtual grid quadtree with Voronoi diagram(VGQ-Vor), which is a two-layer index structure that indexes regions occupied by mobile objects in a quadtree and builds a Voronoi diagram of the regions. Then we propose a moving k nearest neighbor (kNN) query algorithm on the VGQ-Vor and prove the correctness of the algorithm. The experimental results show that the VGQ-Vor outperforms the existing techniques (Bx-tree, Bdual-tree) by one to three orders of magnitude in most cases.