Efficient Construction of Safe Regions for Moving kNN Queries over Dynamic Datasets

Authors:
Mahady Hasan;Muhammad Aamir Cheema;Xuemin Lin;Ying Zhang
Affiliations:
The University of New South Wales, Australia;The University of New South Wales, Australia;The University of New South Wales, Australia;The University of New South Wales, Australia
Venue:
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Year:
2009

Citing 12
Cited 4

Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
Time-parameterized queries in spatio-temporal databases

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

Geoinformatica
Ranking in Spatial Databases

SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
K-Nearest Neighbor Search for Moving Query Point

SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Location-based spatial queries

Proceedings of the 2003 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
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Continuous nearest neighbor search

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The V*-Diagram: a query-dependent approach to moving KNN queries

Proceedings of the VLDB Endowment
Incremental rank updates for moving query points

GIScience'06 Proceedings of the 4th international conference on Geographic Information Science

Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks

The VLDB Journal — The International Journal on Very Large Data Bases
Efficiently processing snapshot and continuous reverse k nearest neighbors queries

The VLDB Journal — The International Journal on Very Large Data Bases
A safe zone based approach for monitoring moving skyline queries

Proceedings of the 16th International Conference on Extending Database Technology
Mondrian tree: A fast index for spatial alarm processing

ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of safe region has been used to reduce the computation and communication cost for the continuous monitoring of k nearest neighbor (k NN) queries. A safe region is an area such that as long as a query remains in it, the set of its k NNs does not change. In this paper, we present an efficient technique to construct the safe region by using cheap RangeNN queries. We also extend our approach for dynamic datasets (the objects may appear or disappear from the dataset). Our proposed algorithm outperforms existing algorithms and scales better with the increase in k .