Title :
Efficient Query Processing in Large Traffic Networks
Author :
Kriegel, Hans-Peter ; Kröger, Peer ; Kunath, Peter ; Renz, Matthias ; Schmidt, Tim
Author_Institution :
Ludwig-Maximilians-Univ. Munchen, Munich
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.
Keywords :
graph theory; query processing; road traffic; traffic engineering computing; embedded graph; filter distance; k-nearest neighbor queries; query processing; shortest path distance; speedup distance-range; traffic networks; Computer networks; Embedded computing; Filters; Material storage; Monitoring; Peer to peer computing; Query processing; Roads; Telecommunication traffic; Traffic control;
Conference_Titel :
Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on
Conference_Location :
Cancun
Print_ISBN :
978-1-4244-1836-7
Electronic_ISBN :
978-1-4244-1837-4
DOI :
10.1109/ICDE.2008.4497586
