Indexing Fast Moving Objects for kNN Queries Based on Nearest Landmarks

Authors:
Dan Lin;Rui Zhang;Aoying Zhou
Affiliations:
Department of Computer Science, The National University of Singapore, Singapore, Singapore;Department of Computer Science, The National University of Singapore, Singapore, Singapore;Department of Computer Science and Engineering, Fudan University, Shanghai, China
Venue:
Geoinformatica
Year:
2006

Citing 0
Cited 3

Location-dependent query processing: Where we are and where we are heading

ACM Computing Surveys (CSUR)
Impact of Applying Aggregate Query Processing in Mobile Commerce

International Journal of Business Data Communications and Networking
A connectivity index for moving objects in an indoor cellular space

Personal and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the rapid advancements in positioning technologies such as the Global Positioning System (GPS) and wireless communications, the tracking of continuously moving objects has become more convenient. However, this development poses new challenges to database technology since maintaining up-to-date information regarding the location of moving objects incurs an enormous amount of updates. Existing indexes can no longer keep up with the high update rate while providing speedy retrieval at the same time. This study aims to improve k nearest neighbor (kNN) query performance while reducing update costs. Our approach is based on an important observation that queries usually occur around certain places or spatial landmarks of interest, called reference points. We propose the Reference-Point-based tree (RP-tree), which is a two-layer index structure that indexes moving objects according to reference points. Experimental results show that the RP-tree achieves significant improvement over the TPR-tree.