Advertisement
Published in:
2009 | OriginalPaper | Chapter
Multiple Object Types KNN Search Using Network Voronoi Diagram
Authors : Geng Zhao, Kefeng Xuan, David Taniar, Maytham Safar, Marina Gavrilova, Bala Srinivasan
Published in: Computational Science and Its Applications – ICCSA 2009
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Existing work on
k
nearest neighbor (
k
NN) in spatial/mobile query processing focuses on single object types. Furthermore, they do not consider optimum path in KNN. In this paper, we focus on multiple type
k
NN whereby the interest points are of multiple types. Additionally, we also consider an optimum path to reach the interest points. We propose three different query types involving multiple object types. Our algorithms adopt the network Voronoi Diagram (NVD). We describe two ways to solve multiple types of KNN queries: one is to create NVD for each object type, and two is to create one NVD for all objects. The comparison between these two approaches is presented in performance evaluation section.