Open AccessSPHLU: An Efficient Algorithm for Processing PR k NN Queries on Uncertain Data
Author(s) -
Wang Shengsheng,
Li Yang,
Chai Sheng,
Bolou Bolou Dickson
Publication year - 2016
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2016.05.002
Subject(s) - pruning , k nearest neighbors algorithm , computer science , heuristic , probabilistic logic , algorithm , value (mathematics) , process (computing) , data mining , upper and lower bounds , artificial intelligence , mathematics , machine learning , agronomy , biology , operating system , mathematical analysis
Query on uncertain data has received much attention in recent years, especially with the development of Location‐based services (LBS). Little research is focused on reverse k nearest neighbor queries on uncertain data. We study the Probabilistic reverse k nearest neighbor (PR k NN) queries on uncertain data. It is succinctly shown that, PR k NN query retrieves all the points that have higher probabilities than a given threshold value to be the Reverse k ‐nearest neighbor (R k NN) of query data Q . The previous works on this topic mostly process with k> 1. Some algorithms allow the cases for k > 1, but the efficiency is inefficient especially for large k . We propose an efficient pruning algorithm — Spatial pruning heuristic with louer and upper bound (SPHLU) for solving the PR k NN queries for k > 1. The experimental results demonstrate that our algorithm is even more efficient than the existent algorithms especial for a large value of k .