Database Paper Browser

Back to papers

Progressive Computation of the Min-Dist Optimal-Location Query

Summary: Progressive min-dist optimal-location query: pick a new site in Q to minimize average distance to closest site. Key ideas: bound on candidate locations; progressive refinement with error guarantees; estimators for pruning to the exact answer. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9478
Venue
VLDB
Year
2006
Pagerank
7.2958583e-05
Overall Rank
3,272 | 77.24%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
601 Influence Sets Based on Reverse Nearest Neighbor Queries 2000 SIGMOD 0.00019375875
1,682 Discovery of Influence Sets in Frequently Updated Databases 2001 VLDB 0.00010923103
1,933 Reverse kNN Search in Arbitrary Dimensionality 2004 VLDB 0.00010038508
Previous Page 1 / 1 Next

Semantically Similar Papers