Sciweavers

GEOINFORMATICA
2006

Indexing Fast Moving Objects for kNN Queries Based on Nearest Landmarks

13 years 4 months ago
Indexing Fast Moving Objects for kNN Queries Based on Nearest Landmarks
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 ReferencePoint-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...
Dan Lin, Rui Zhang 0003, Aoying Zhou
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2006
Where GEOINFORMATICA
Authors Dan Lin, Rui Zhang 0003, Aoying Zhou
Comments (0)