Database Paper Browser

Back to papers

Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases

Summary: Efficiently finds top-k probable nearest neighbors under a general uncertainty model for data and queries. Introduces new query semantics and fast methods to compute marginal NN probabilities; handles dependencies and threshold queries, with experiments. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9678
Venue
VLDB
Year
2008
Pagerank
0.00011456321
Overall Rank
1,542 | 89.28%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 17 of 17 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 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