CircularTrip: An effective algorithm for continuous kNN queries

Muhammad Aamir Cheema, Yuan Yidong, Lin Xuemin

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

11 Citations (Scopus)

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 Circular Trip-based continuous kNN algorithm is developed. Compared with the existing algorithms, our algorithm is both space and time efficient.

Original languageEnglish
Title of host publicationAdvances in Databases
Subtitle of host publicationConcepts, Systems and Applications - 12th International Conference on Database Systems for Advanced Applications, DASFAA 2007, Proceedings
PublisherSpringer
Pages863-869
Number of pages7
ISBN (Print)9783540717027
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Event12th International Conference on Database Systems for Advanced Applications, DASFAA 2007 - Bangkok, Thailand
Duration: 9 Apr 200712 Apr 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4443 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Conference on Database Systems for Advanced Applications, DASFAA 2007
CountryThailand
CityBangkok
Period9/04/0712/04/07

Cite this