Paper Info
Title
Moving K-Nearest Neighbor Query over Obstructed Regions
Abstract
In recent years, there has been a growing need for location-based services (LBS), ranging from resource tracking to personal life assistance. The Moving k Nearest Neighbor (MkNN) query is a main problem in the LBS area, which retrieves the top k nearest neighbors while the query consumer moves. Considerable attention is attracted to this query type and a large number of studies are proposed recently. Most of these studies focus on ideal Euclidean plane where any two points are visible. In this paper, we propose a method to process MkNN queries in areas with obstacles, which is more realistic. We propose the obstacle-free safe region (OSR) concept within which a query point has the same kNN. No additional processing is required when the query consumer moves inside one OSR. Several novel properties are also introduced and employed in our efficient MkNN processing algorithm. Our experimental results show that our approach handles the MkNN queries with high accuracy and works efficiently.
Year
DOI
Venue
2010
10.1109/APWeb.2010.28
APWeb
Keywords
Field
DocType
additional processing,k nearest neighbor,considerable attention,mknn query,obstructed regions,top k,k-nearest neighbor query,lbs area,query point,location-based service,efficient mknn processing algorithm,mobile computing,query type,query consumer move,query processing,obstacle-free safe region concept,servers,frequency modulation,mobile communication,trajectory,construction industry,shape,location based service
Mobile computing,k-nearest neighbors algorithm,Query optimization,Data mining,Computer science,Server,Location-based service,Ranging,Mobile telephony,Database,Trajectory
Conference
ISBN
Citations 
PageRank 
978-1-4244-6600-9
11
0.50
References 
Authors
10
4
Name
Order
Citations
PageRank
Chuanwen Li1489.53
Yu Gu220134.98
Fangfang Li3143.59
Mo Chen4252.03