A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Proximity queries in large traffic networks
2007
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems - GIS '07
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm of filter-refinement query processing and can be used for proximity queries on both static as well as dynamic objects. In particular, we present how our embedding can be used to compute a lower and upper bounding filter distance which approximates the true shortest path distance significantly better than traditional
doi:10.1145/1341012.1341040
dblp:conf/gis/KriegelKKRS07
fatcat:yxn6vq5yzrg73kixpw2ffxurr4