Lower-Bound Distance Queries under Partial Information
Summary: Studies lower-bound distance queries when only a subset of metric-graph edge distances is observed, without a distance oracle. Exploits triangle-inequality feasibility to trade preprocessing, query time, and bound tightness with provable guarantees and empirical gains. (summarized by gpt-5.6-luna on Aug 28 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Swastik Biswas (New Jersey Institute of Technology)
- 2. Sohrab Namazi Nia (New Jersey Institute of Technology)
- 3. Jees Augustine (Microsoft)
- 4. Suraj Shetiya (Indian Institute of Technology Mumbai)
- 5. Senjuti Basu Roy (New Jersey Institute of Technology)
- 6. Gautam Das (University of Texas)
BibTeX Citation
@article{biswas_vldb26,
title = {{Lower-Bound Distance Queries under Partial Information}},
author = {Biswas, Swastik and Nia, Sohrab Namazi and Augustine, Jees and Shetiya, Suraj and Roy, Senjuti Basu and Das, Gautam},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {11},
pages = {3807--3819},
doi = {10.14778/3836663.3836727},
url = {https://doi.org/10.14778/3836663.3836727},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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 |
|---|---|---|---|---|
| 4,501 | Query Processing for Distance Metrics | 1990 | VLDB | 6.5741203e-05 |
| 5,911 | On Efficient Approximate Queries over Machine Learning Models | 2023 | VLDB | 5.9501384e-05 |
| 8,786 | A Generalized Approach for Reducing Expensive Distance Calls for A Broad Class of Proximity Problems | 2021 | SIGMOD | 5.2768554e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,501 | Query Processing for Distance Metrics | 1990 | VLDB |
| 2 | 8,701 | New Lower and Upper Bounds for Shortest Distance Queries on Terrains | 2016 | VLDB |
| 3 | 3,820 | The Pursuit of a Good Possible World: Extracting Representative Instances of Uncertain Graphs | 2014 | SIGMOD |
| 4 | 9,811 | Fast and Exact Outlier Detection in Metric Spaces: A Proximity Graph-based Approach | 2021 | SIGMOD |
| 5 | 11,491 | k-Clustering with Comparison and Distance Oracles | 2024 | PODS |
| 6 | 1,063 | k-Nearest Neighbors in Uncertain Graphs | 2010 | VLDB |
| 7 | 4,551 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD |
| 8 | 8,786 | A Generalized Approach for Reducing Expensive Distance Calls for A Broad Class of Proximity Problems | 2021 | SIGMOD |
| 9 | 1,635 | Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases | 2008 | VLDB |
| 10 | 10,395 | Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation | 2026 | PODS |