Efficient Query Processing in Large Traffic Networks

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 b...

Full description

Saved in:
Bibliographic Details
Main Authors: Kriegel, H.-P., Kroger, P., Kunath, P., Renz, M., Schmidt, T.
Format: Conference Proceeding
Language:English
Subjects:
Computer networks
Embedded computing
Filters
Material storage
Monitoring
Peer to peer computing
Query processing
Roads
Telecommunication traffic
Traffic control
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1063-6382
2375-026X
DOI:10.1109/ICDE.2008.4497586