Circulartrip: an effective algorithm for continuous kNN queries

Authors:
Muhammad Aamir Cheema;Yidong Yuan;Xuemin Lin
Affiliations:
The University of New South Wales, Australia;The University of New South Wales, Australia;The University of New South Wales, Australia
Venue:
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Year:
2007

Citing 10
Cited 3

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
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
A generic framework for monitoring continuous spatial queries over moving objects

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
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
Continuous K-nearest neighbor queries for continuously moving points with updates

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

A unified algorithm for continuous monitoring of spatial queries

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
k-Nearest neighbor query processing method based on distance relation pattern

Proceedings of the 20th ACM international conference on Information and knowledge management
Efficient algorithms to monitor continuous constrained k nearest neighbor queries

DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Continuously monitoring kNN queries in a highly dynamic environment has become a necessity to many recent location-based applications. In this paper, we study the problem of continuous kNN query on the dataset with an in-memory grid index. We first present a novel data access method - CircularTrip. Then, an efficient CircularTrip-based continuous kNN algorithm is developed. Compared with the existing algorithms, our algorithm is both space and time efficient.