Database Paper Browser

Back to papers

Nearest Neighbor Searching Under Uncertainty II

Summary: Nearest-neighbor search for points with probabilistic locations (PDFs); introduces efficient algorithms to enumerate all points with nonzero NN probability and to estimate each point’s NN probability within a specified additive error. Also gives methods to return the maximum-probability NN or all points above a threshold, with experimental validation. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1602
Venue
PODS
Year
2013
Pagerank
4.839879e-05
Overall Rank
7,084 | 50.72%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
9,308 Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates 2015 SIGMOD 4.3571035e-05
9,761 Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations 2025 PODS 4.2856106e-05
11,824 Range-Max Queries on Uncertain Data 2016 PODS 4.1945683e-05
11,905 Supporting Data Uncertainty in Array Databases 2015 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
1,542 Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases 2008 VLDB 0.00011456321
4,724 Nearest-Neighbor Searching Under Uncertainty 2012 PODS 5.9697823e-05
Previous Page 1 / 1 Next

Semantically Similar Papers