Introduction
Spatial network databases render support for spatial networks by providing the necessary data model, query language, storage structure, and indexing methods. Spatial networks can be modeled as graphs where nodes are points embedded in space. One distinguishing characteristic of a spatial network is the primary focus on the role of connectivity in relationships rather than the spatial proximity between objects. Spatial network databases are the kernel of many important applications, including transportation planning; air traffic control; water, electric, and gas utilities; telephone networks; urban management; utility network maintenance; and irrigation canal management. The underlying data of interest for these applications are structured as a spatial graph, which consists of a finite collection of the points (i.e., nodes), the line segments (i.e., edges) connecting the points, the location of the points, and the attributes of the points and line segments that connect the...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bellman RE (1958) On a routing problem. Quart Appl Math 16:87–90
Chartrand G (1985) The konigsberg bridge problem: an introduction to eulerian graphs. Introductory Graph Theory, Dover
Cherkassky BV, Goldberg AV, Radzik T (1996) Shortest paths algorithms: theory and experimental evaluation. Math Program 73:129174
Delling D, Goldberg AV, Werneck RF (2011) Shortest paths in road networks: from practice to theory and back. Inf Technol 53:294–301
Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271
Erwig M, Guting RH (1994) Explicit graphs in a functional model for spatial databases. IEEE Trans Knowl Data Eng 6(5):787–804
ESRI (2014) ESRI: ArcGIS network analyst. http://www.esri.com/software/arcgis/extensions/networkanalyst/
George B, Kim S, Shekhar S (2007) Spatio-temporal network databases and routing algorithms: a summary of results. In: Proceedings of 10th international symposium on spatial and temporal databases (SSTD), Boston
Gunturi V, Nunes E, Soo K, Shekhar S (2011) A critical-time-point approach to all-start-time lagrangian shortest paths: a summary of results. In: Proceedings of international symposium on spatial and temporal databases (SSTD), Minneapolis
Guting R (1994) Graphdb: modeling and querying graphs in databases. In: Proceedings of 20th international conference on very large databases, Santiago, pp 297–308
Hart PE, Nilsson NJ, Raphael B (1986) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100-107
HERE (2014) HERE. http://www.here.com/
Hoel EG, Heng W, Honeycutt D (2005) High performance multimodal networks. In: Proceedings of international symposium on spatial and temporal databases (SSTD), Angra dos Reis
Oracle Spatial (2009) A load-on-demand approach to handling large networks in the oracle spatial network data model. http://www.oracle.com/technetwork/database/options/spatialandgraph/documentation
TomTom (2014) TomTom. http://www.tomtom.com/
Winter S (2002) Modeling cost of turns in route planning. GeoInformatica 6:363–380
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this entry
Cite this entry
Wang, CH., Gong, H., George, B., Freiwald, C. (2017). Spatial Network Database and Routing in Oracle Spatial. In: Shekhar, S., Xiong, H., Zhou, X. (eds) Encyclopedia of GIS. Springer, Cham. https://doi.org/10.1007/978-3-319-17885-1_1529
Download citation
DOI: https://doi.org/10.1007/978-3-319-17885-1_1529
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17884-4
Online ISBN: 978-3-319-17885-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering