Dynamic Reverse Furthest Neighbor Querying Algorithm of Moving Objects

With the development of wireless communications and positioning technologies, locations of moving objects are highly demanding services. The assumption of static data is majorly applied on previous researches on reverse furthest neighbor queries. However, the data are dynamic property in the real world. Even, the data-aware are uncertain due to the limitation of measuring equipment or the delay of data communication. To effectively find the influence of querying a large number of moving objects existing in boundary area vs querying results of global query area, we put forward dynamic reverse furthest neighbor query algorithms and probabilistic reverse furthest neighbor query algorithms. These algorithms can solve the query of weak influence set for moving objects. Furthermore, we investigate the uncertain moving objects model and define a probabilistic reverse furthest neighbor query, and then present a half-plane pruning for individual moving objects and spatial pruning method for uncertain moving objects. The experimental results show that the algorithm is effective, efficient and scalable in different distribution and volume of data sets.

[1]  Xiang Lian,et al.  Probabilistic Group Nearest Neighbor Queries in Uncertain Databases , 2008, IEEE Transactions on Knowledge and Data Engineering.

[2]  Stefan Langerman,et al.  Facility location problems in the plane based on reverse nearest neighbor queries , 2010, Eur. J. Oper. Res..

[3]  Jianquan Liu,et al.  An Efficient Algorithm for Reverse Furthest Neighbors Query with Metric Index , 2010, DEXA.

[4]  Sahin Albayrak,et al.  User-centric evaluation of a K-furthest neighbor collaborative filtering recommender algorithm , 2013, CSCW.

[5]  Xiang Lian,et al.  Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data , 2009, The VLDB Journal.

[6]  Jianquan Liu,et al.  An Efficient Algorithm for Arbitrary Reverse Furthest Neighbor Queries , 2012, APWeb.

[7]  Jian Pei,et al.  Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data , 2010, IEEE Transactions on Knowledge and Data Engineering.

[8]  Botao Wang,et al.  Efficient Probabilistic Reverse k-Nearest Neighbors Query Processing on Uncertain Data , 2013, DASFAA.

[9]  Xue Wang,et al.  Predictive Nearest Neighbor Queries over Uncertain Spatial-Temporal Data , 2014, WASA.

[10]  Sunil Prabhakar,et al.  Querying imprecise data in moving object environments , 2003, IEEE Transactions on Knowledge and Data Engineering.

[11]  Hans-Peter Kriegel,et al.  Reverse-Nearest Neighbor Queries on Uncertain Moving Object Trajectories , 2014, DASFAA.

[12]  Yufei Tao,et al.  Reverse kNN Search in Arbitrary Dimensionality , 2004, VLDB.

[13]  Sergey Bereg,et al.  Facility location problems with uncertainty on the plane , 2005, Discret. Optim..

[14]  Roberto Tamassia,et al.  Continuous probabilistic nearest-neighbor queries for uncertain trajectories , 2009, EDBT '09.

[15]  Hans-Peter Kriegel,et al.  Boosting spatial pruning: on optimal pruning of MBRs , 2010, SIGMOD Conference.

[16]  Feifei Li,et al.  Reverse Furthest Neighbors in Spatial Databases , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[17]  Ge Yu,et al.  Interval reverse nearest neighbor queries on uncertain data with Markov correlations , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[18]  Junjie Yao,et al.  Challenging the Long Tail Recommendation , 2012, Proc. VLDB Endow..

[19]  Flip Korn,et al.  Influence sets based on reverse nearest neighbor queries , 2000, SIGMOD 2000.