Progressive Computation of the Min-Dist Optimal-Location Query
Summary: Introduces the min-dist optimal-location query: choose a new site in a region to minimize weighted average nearest-site distance, using L1 metrics. A finite-candidate theorem and progressive refinement provide error-bounded locations, reusable pruning, and eventual exactness. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Donghui Zhang (Northeastern University)
- 2. Yang Du (Northeastern University)
- 3. Tian Xia (Northeastern University)
- 4. Yufei Tao (Chinese University of Hong Kong)
BibTeX Citation
@article{zhang_vldb06,
title = {{Progressive Computation of the Min-Dist Optimal-Location Query}},
author = {Zhang, Donghui and Du, Yang and Xia, Tian and Tao, Yufei},
journal = {PVLDB},
series = {{VLDB} '06},
pages = {643--654},
year = {2006}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,024 | A Scalable Algorithm for Maximizing Range Sum in Spatial Databases | 2012 | VLDB | 7.8388143e-05 |
| 3,118 | Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor | 2009 | VLDB | 7.7373846e-05 |
| 3,700 | Approximate MaxRS in Spatial Databases | 2013 | VLDB | 7.1861452e-05 |
| 6,251 | The Flexible Socio Spatial Group Queries | 2019 | VLDB | 5.9415675e-05 |
| 6,469 | Efficient and Progressive Group Steiner Tree Search | 2016 | SIGMOD | 5.8710857e-05 |
| 6,683 | Efficient Algorithms for Optimal Location Queries in Road Networks | 2014 | SIGMOD | 5.8037274e-05 |
| 7,378 | Maximizing Bichromatic Reverse Spatial and Textual k Nearest Neighbor Queries | 2016 | VLDB | 5.6294729e-05 |
| 7,600 | Towards Best Region Search for Data Exploration | 2016 | SIGMOD | 5.5867987e-05 |
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 |
|---|---|---|---|---|
| 546 | Influence Sets Based on Reverse Nearest Neighbor Queries | 2000 | SIGMOD | 0.00016734556 |
| 1,612 | Reverse kNN Search in Arbitrary Dimensionality | 2004 | VLDB | 0.00010218134 |
| 1,681 | Discovery of Influence Sets in Frequently Updated Databases | 2001 | VLDB | 0.00010022485 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,681 | Discovery of Influence Sets in Frequently Updated Databases | 2001 | VLDB |
| 2 | 8,848 | A Generalized Approach for Reducing Expensive Distance Calls for A Broad Class of Proximity Problems | 2021 | SIGMOD |
| 3 | 3,703 | Approximation Techniques for Spatial Data | 2004 | SIGMOD |
| 4 | 3,562 | Location-based Spatial Queries | 2003 | SIGMOD |
| 5 | 449 | Query Processing in Spatial Network Databases | 2003 | VLDB |
| 6 | 9,355 | Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates | 2015 | SIGMOD |
| 7 | 2,349 | On Efficient Spatial Matching | 2007 | VLDB |
| 8 | 1,441 | Efficient Processing of Top-k Spatial Preference Queries | 2011 | VLDB |
| 9 | 6,683 | Efficient Algorithms for Optimal Location Queries in Road Networks | 2014 | SIGMOD |
| 10 | 3,024 | A Scalable Algorithm for Maximizing Range Sum in Spatial Databases | 2012 | VLDB |