DBScholar

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
h071b0967adde0e5b
Venue
VLDB
Year
2011
Pagerank
5.8850424e-05
Overall Rank
6,108 | 58.94%
DOI
10.14778/1920841.1920928

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{bernecker_vldb11,
        title = {{Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data}},
        author = {Bernecker, Thomas and Emrich, Tobias and Kriegel, Hans-Peter and Renz, Matthias and Zankl, Stefan and Züfle, Andreas},
        journal = {PVLDB},
        series = {{VLDB} '11},
        volume = {3},
        number = {1},
        pages = {669--680},
        doi = {10.14778/1920841.1920928},
        url = {https://doi.org/10.14778/1920841.1920928},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

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