Definition
In vector space, the distance between two objects can be computed as a function of the components of the vectors representing the objects. A typical distance function for multidimensional vector spaces is the well-known Minkowski metric, with the Euclidean metric as a popular case for two-dimensional space. Therefore, the distance computation in multidimensional vector spaces is fast because its complexity depends on the number of dimensions which is limited to two or three in geospatial applications. However, with road-networks, the distance between two objects is measured by their network distance, i.e., the length of the shortest path through the network edges that connects the two locations. This computationally expensive network-based metric mainly depends on the connectivity of the network. For example, representing a road network as a graph with e weighted edges and vvertices, the complexity...
Recommended Reading
Almeida VTD, Güting RH. Indexing the trajectories of moving objects in networks. GeoInformatica. 2005;9(1):33–60.
Cho H.-J, Chung C.-W. An efficient and scalable approach to cnn queries in a road network. In Proceeding of 31st International Conference on Very Large Data Bases, 2005, p. 865–876.
Güting H, de Almeida T, Ding Z. Modeling and querying moving objects in networks. VLDB J. 2006;15(2):165–90.
Hu H, Lee DL, Lee VCS. Distance indexing on road networks. In Proceeding of 32nd International Conference on Very Large Data Bases, 2006, pp. 894–905.
Hu H, Lee DL, Xu J. Fast nearest neighbor search on road networks. In Advances in Database Technology, Proceeding 10th International Conference on Exdending Database Technology, 2006, p. 186–203.
Huang X, Jensen CS, Saltenis S. The islands approach to nearest neighbor querying in spatial networks. In Proceeding 9th International Symposium Advances in Spatial and Temporal Databases, 2005, p. 73–90.
Jensen CS, Kolářvr J, Pedersen TB, Timko I. Nearest neighbor queries in road networks. In Proceediong 11th ACM International. Symposium on Advances in Geographic Inf. Syst., 2003, p. 1–8.
Kolahdouzan MR, Shahabi C. Voronoi-based k nearest neighbor search for spatial network databases. In Proceeding 30th International Conference on Very Large Data Bases, 2004, p. 840–51.
Ku W-S, Zimmermann R, Wang H, Wan C-N. Adaptive nearest neighbor queries in travel time networks. In Proceeding of 13th ACM International Symposium on Geographic Inf. Syst., 2005, p. 210–19.
Papadias D, Zhang J, Mamoulis N, Tao Y. Query processing in spatial network databases. In Proceeding of 29th International Conference on Very Large Data Bases, 2003, p. 790–801.
Pfoser D, Jensen CS. Indexing of network constrained moving objects. In Proceeding 11th ACM International Symposium on Advances in Geographic Inf. Syst., 2003, p. 25–32.
Sankaranarayanan J, Alborzi H, Samet H. Efficient query processing on spatial networks. In Proceeding 13th ACM International Symposium on Geographic Inf. Syst., 2005. p. 200–09.
Shahabi C, Kolahdouzan MR, Sharifzadeh M. A road network embedding technique for k-nearest neighbor search in moving object databases. In Proceeding 10th ACM International Symposium on Advances in Geographic Inf. Syst., 2002, p. 94–100.
Sharifzadeh M, Shahabi C. Processing optimal sequenced route queries using voronoi diagrams. GeoInformatica. 2008;12(4):411–33.
Yiu ML, Mamoulis N, Papadias D. Aggregate nearest neighbor queries in road networks. IEEE Trans Knowl Data Eng. 2005;17(6):820–3.
Fleischmann B, Gietz M, Gnutzmann S. Time-varying travel times in vehicle routing. Transp Sci. 2004;38(2):160–73.
Demiryurek U, Banaei-Kashani F, Shahabi C. A case for time-dependent shortest path computation in spatial networks. ACMGIS; 2010. p. 474–77.
Cooke L, Halsey E. The shortest route through a network with time-dependent internodal transit times. J Math Anal Appl. 1966.
Dreyfus SE. An appraisal of some shortest-path algorithms. Oper Res. 1969;17, no. 3.
Ding B, Yu JX, Qin L. Finding time-dependent shortest paths over large graphs. EDBT 2008; p. 205–16.
Delling D, Wagner D. Time-dependent route planning. Robust and Online Large-Scale Optimization 2009; p. 207–30.
Demiryurek U, Kashani FB, Shahabi C, Ranganathan A. Online computation of fastest path in time-dependent spatial networks, SSTD, 2011.
Smith B, Demetsky M. Traffic flow forecasting: comparison of modeling approaches. J Transp Eng. 1997;123(4):261–6.
Pan B, Demiryurek U, Shahabi C. Utilizing real-world transportation data for accurate traffic prediction. IEEE ICDM 2012; p. 595–604.
Clark S. Traffic prediction using multivariate nonparametric regression. In JTE’03, volume 129.
Pan B, Demiryurek U, Shahabi C, Gupta C. Forecasting spatiotemporal impact of traffic incidents on road networks. IEEE ICDM 2013; p. 587–96.
Demiryurek U, Kashani FB, Shahabi C. Efficient K-nearest neighbor search in time-dependent spatial networks. DEXA (1) 2010; p. 432–49.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media LLC
About this entry
Cite this entry
Shahabi, C. (2014). Road Networks. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_319-2
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7993-3_319-2
Received:
Accepted:
Published:
Publisher Name: Springer, New York, NY
Online ISBN: 978-1-4899-7993-3
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering