Database Paper Browser

Back to papers

Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data

Summary: Proposes efficient probabilistic reverse nearest neighbor (PRNN) processing on uncertain data, using distance-dependency aware pruning to bound probabilities and prune candidates. Demonstrates strong empirical gains and extends to PRkNN (k>1). (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10294
Venue
VLDB
Year
2011
Pagerank
4.8909775e-05
Overall Rank
6,946 | 51.68%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
8,087 Similarity Search and Mining in Uncertain Databases 2010 VLDB 4.5899317e-05
9,121 Hypersphere Dominance: An Optimal Approach 2014 SIGMOD 4.3922853e-05
9,309 Reverse k Nearest Neighbors Query Processing: Experiments and Analysis 2015 VLDB 4.3571035e-05
9,494 Spatial Data Quality in the IoT Era: Management and Exploitation 2022 SIGMOD 4.3341665e-05
11,904 Indexing Metric Uncertain Data for Range Queries 2015 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers