DBScholar

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
9869
Venue
VLDB
Year
2008
Pagerank
0.00010229844
Overall Rank
1,605 | 88.99%
DOI
10.14778/1453856.1453895

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{beskales_vldb08,
        title = {{Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases}},
        author = {Beskales, George and Soliman, Mohamed A. and Ilyas, Ihab F.},
        journal = {PVLDB},
        series = {{VLDB} '08},
        volume = {1},
        number = {1},
        pages = {326--337},
        doi = {10.14778/1453856.1453895},
        url = {https://doi.org/10.14778/1453856.1453895},
        year = {2008}
}

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