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
.
Efficient Query Processing in Large Traffic Networks
2008
2008 IEEE 24th International Conference on Data Engineering
We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our method is used to compute a lower and upper bounding filter distance which approximates the true shortest path distance significantly better than traditional filters. In addition, we discuss how the computation of the exact shortest path distance in the refinement step can be boosted by using the embedded graph.
doi:10.1109/icde.2008.4497586
dblp:conf/icde/KriegelKKRS08
fatcat:kqyryhz22jgolcyey57gj3ofge