Sciweavers

Share
ICDE
2008
IEEE

Efficient Query Processing in Large Traffic Networks

10 years 5 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- 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.
Hans-Peter Kriegel, Matthias Renz, Peer Kröge
Added 01 Nov 2009
Updated 01 Nov 2009
Type Conference
Year 2008
Where ICDE
Authors Hans-Peter Kriegel, Matthias Renz, Peer Kröger, Peter Kunath, Tim Schmidt
Comments (0)
books