Probabilistic CkNN Queries of Uncertain Data in Large Road Networks

Continuous <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-nearest neighbor (CkNN) query processing is an important issue in spatial temporal databases. In real-world scenarios, query clients and data objects may move with uncertain speeds on the road networks, which makes retrieving the exact CkNN query result a challenge. This paper addresses the issue of processing probabilistic CkNN queries of uncertain data (CPkNN) for road networks, where moving objects and query points are restricted by the connectivity of the road network and the object-query distance updates affect the query result. A novel model is proposed to estimate network distances between moving objects and a submitted moving query in the road network. Then, a CPkNN query monitoring method is presented to continuously report the possible result objects within a given time interval. In addition, an efficient method is proposed to arrange all the candidate objects according to their probabilities of being a kNN of a query. The method then chooses the top-<inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> objects as the final query result. In addition, we extend our method to large networks with high efficiency. Finally, extensive experiments are conducted to demonstrate the effectiveness of the proposed schema.

[1]  Denilson Barbosa,et al.  TASM: Top-k Approximate Subtree Matching , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[2]  Ihab F. Ilyas,et al.  Efficient search for the top-k probable nearest neighbors in uncertain databases , 2008, Proc. VLDB Endow..

[3]  Ping Fan,et al.  CkNN Query Processing over Moving Objects with Uncertain Speeds in Road Networks , 2011, APWeb.

[4]  Gang Chen,et al.  Efficient Collective Spatial Keyword Query Processing on Road Networks , 2016, IEEE Transactions on Intelligent Transportation Systems.

[5]  Yuan-Ko Huang,et al.  Continuous K-Nearest Neighbor Query over Moving Objects in Road Networks , 2009, APWeb/WAIM.

[6]  Qing Li,et al.  Searching continuous nearest neighbors in road networks on the air , 2014, Inf. Syst..

[7]  Muhammad Aamir Cheema,et al.  Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks , 2011, The VLDB Journal.

[8]  Chi-Yin Chow,et al.  Scalable processing of snapshot and continuous nearest-neighbor queries over one-dimensional uncertain data , 2009, The VLDB Journal.

[9]  Yuan-Ko Huang,et al.  Scalable Processing of Continuous K-Nearest Neighbor Queries with Uncertainty in Spatio-Temporal Databases , 2009, 2009 International Conference on Research Challenges in Computer Science.

[10]  Yuan-Ko Huang,et al.  Efficient evaluation of continuous spatio-temporal queries on moving objects with uncertain velocity , 2010, GeoInformatica.

[11]  Maytham Safar,et al.  Enhanced Continuous KNN Queries Using PINE on Road Networks , 2007, 2006 1st International Conference on Digital Information Management.

[12]  Yufei Tao,et al.  Query Processing in Spatial Network Databases , 2003, VLDB.

[13]  Jianliang Xu,et al.  A generic framework for monitoring continuous spatial queries over moving objects , 2005, SIGMOD '05.

[14]  Hua Lu,et al.  Scalable Evaluation of Trajectory Queries over Imprecise Location Data , 2014, IEEE Transactions on Knowledge and Data Engineering.

[15]  Takahiro Hara,et al.  Top-k Query Processing and Malicious Node Identification Based on Node Grouping in MANETs , 2016, IEEE Access.

[16]  Cyrus Shahabi,et al.  A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases , 2002, GIS '02.

[17]  Tae-Sun Chung,et al.  A Safe-Region Approach to k-RNN Queries in Directed Road Network , 2014, 2014 IEEE 17th International Conference on Computational Science and Engineering.

[18]  Yuan-Ko Huang,et al.  Evaluating continuous K-nearest neighbor query on moving objects with uncertainty , 2009, Inf. Syst..

[19]  Christopher Leckie,et al.  Efficient query processing on road traffic network , 2016, 2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops).

[20]  Chin-Wan Chung,et al.  An Efficient and Scalable Approach to CNN Queries in a Road Network , 2005, VLDB.

[21]  Christian S. Jensen,et al.  The Islands Approach to Nearest Neighbor Querying in Spatial Networks , 2005, SSTD.

[22]  Cyrus Shahabi,et al.  Alternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Network Databases , 2005, STDBM.

[23]  Zhinong Zhong,et al.  Processing of Continuous k Nearest Neighbor Queries in Road Networks , 2009, Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing.

[24]  Christopher Ré,et al.  Efficient Top-k Query Evaluation on Probabilistic Data , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[25]  Kyriakos Mouratidis,et al.  Continuous nearest neighbor monitoring in road networks , 2006, VLDB.

[26]  Cyrus Shahabi,et al.  Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases , 2004, VLDB.

[27]  Viktor K. Prasanna,et al.  FP-CPNNQ: A Filter-Based Protocol for Continuous Probabilistic Nearest Neighbor Query , 2015, DASFAA.