Jul 2026
Lower-Bound Distance Queries under Partial Information
Given a metric space graph G ( V, E ) in which only a subset of edge distances is known, we study a query-based model for answering lower bound distance queries on unknown edges, without access to any black-box distance oracle. For a queried pair of objects ( u, υ ) with unknown distance, the lower bound corres...
Swastika Biswas, Sohrab Namazi Nia, Jees Augustine et al.
· Proceedings of the VLDB Endo... · 0 citations