Many hyperlinks are disabled.
Use anonymous login to enable hyperlinks.

back

Table of Contents

1 -Introduction

Theoretical foundations - an ultra-quick recall

• All items in the dataset are called Links (aka Arcs), and are expected to represent some oriented connection joining two Nodes.
  Example: in the above figure Link L3 connects Nodes N2 and N5.
• So all Links are always expected to explicitly reference a Start-Node (aka Node-From) and an End-Node (aka Node-To).
  • Links are always oriented, and their natural direction is From-To:
    • in an unidirectional Network each Link is an one-way connection.
      If the connection is available in the opposite direction a second Link must be explicitly declared.
      Example: Link X1 goes from Node A to Node B, and Link X2 goes from Node B to Node A.
    • in a bidirectional Network all Links are assumed to establish a connection in both directions.
      Definiting an one-way connection requires an appropriate attribute to be set (see below).
  • The Start- and End-Node could eventually be the same, and in this case we'll have a self-closed Link.
  • Network's Links can eventually define a linear Geometry (LINESTRING) going from the Start-Node to the End-Node, but this is an optional feature, not a mandatory requirement.
  • What is absolutely mandatory is that each Link must explicitly reference its Nodes.
• A Network supporting Geometries is a Spatial Network; otherwise a Network lacking any Geometry is a Logical Network.
  • In a Spatial Network all Links must have a corresponding Geometry.
  • In a Logical Network all Links are strictly forbidden to have any Geometry.
  • In a Spatial Network both the StartPoint and EndPoint of each Link's LINESTRING are always expected to exactly coincide with the corresponding Nodes.
• In a Spatial Network all references to the same Node by different Links must be an exact match.
  Example: Node N5 is shared by Links L3, L6, L7, L9 and L10, so all their corresponding LINESTRINGS are expected to have the corresponding extremity (Start- or End-, depending on the orientation) points that must exactly match the other.
  A topological inconsistency exists if any of these conditions are not satisfied, which leads to an invalid Network.
• In a Spatial Network two
• Accordingly to the above premises, Nodes are never expected to be explicitly declared in a separate Table.
  Just a single Table declaring all Links is required in order to fully define a topologically valid Network.
  All the Nodes can then be easily extracted from the Links' definitions and the coordinates for each Node can be directly set by extracting the extreme Point of the corresponding Linestrings.
  If any mismatch is detected this surely means that the Network is invalid.
• A Link may legitimately self-intersect itself (e.g. forming a loop), as shown in the above figure by Link L15 (orange spot).
• Two Links may legitimately intersect where no Node exists, as exemplified on the above figure by Links L4 and L7 (green spot).
  This usually happens when one of the two Links overpasses the other, or where some technical restriction exists (e.g. two insulated wires in an Electrical Network).
• Links aren't strictly required to be associated with any specific attribute, but the following attributes are almost universally supported:
  • a name identifying the Link.
    Examples: the road toponym in a road network, or the river name in an hydrographic network.
  • one (or even more) appropriate cost value(s).
    Example: the time required to traverse the Link (may be distinguished between pedestrians, bicycles, cars, lorries and so on).
  • a pair of boolean flags (from-to and to-from) are intendend to specify if the Link can be traversed on both directions or just in one (one-way).

Logical conclusions

• Hydrographic Networks.
• Gas / Water / Oil Networks.
• Electrical Networks.
• Telecomunication Networks.
• Social or Economical Networks representing relationships between individuals or companies.
• Epidemiological Networks representing the propagation of infective diseases between individuals or groups.

The Dijkstra's algorithm

• Any Node-to-Node connection identified by Dijkstra's is certainly ensured to be optimal.
  In other words, no connetction presenting a lower cost can conceptually exist.
• When Dijsjtra's fails to identify a solution this surely means that no solution is possible.

The A* algorithm

2 - The sample/test DB

• all road names are stored within the toponyms Table.
  the same road name could be used in different Municipalities, so the toponyms Table relationally references the municipalities Table (via PRIMARY / FOREIGN KEY relationships).
• the roads Spatial Table contains about 380,000 Links, and has the following columns:
  • id: unique identifier of each Link (PRIMARY KEY).
  • node_from and node_to: Node identifiers. The original Iter.Net dataset adopts very long an complex alphanumeric Node codes; the integer Node IDs were obtained by calling the CreateRoutingNodes() SQL function discussed in a following section.
  • id_toponym: relational reference to the corresponding road name contained into the toponyms Table (FOREIGN KEY).
  • speed_kmh: the estimated average speed supported by the Link, expressed in km/h.
    Note: negative speeds intend a forbidden Link.
  • oneway_fromto and oneway_tofrom: boolean flags intended to state if a Link can be traversed in both directions or just in a single direction (one-way).
    Note: all Links declaring oneway_fromto=0 and oneway_tofrom=0 are intended to be always forbidden.
  • cost: the time expressed in seconds required to traverse each Link.
    Note #1 all costs were calculated accordingly to the following formula: cost = ((ST_Length(geom) / 1000.0) / speed_kmh) * 3600.0
    Note #2 all 86,400.0 cost values (equivalent to 1 day) approximate an infinitive cost thus intending a forbidden Link.
  • geom: a 3D Linestring representing the Geometry of each Link.
    Note: the original Iter.Net dataset is just 2D; elevations (Z coordinates) were interpolated by draping the dataset over an orographic DEM (10m X 10m cells)
• the roads_vw Spatial View is just intended to fully resolve all relational references between roads, toponyms and municipalities, thus allowing for easier SQL queries.
• the house_nr Spatial Table contains about 1,480,000 House Numbers, and has the following columns:
  • id: unique identifier of each House Number (PRIMARY KEY).
  • id_road: relational reference to the corresponding Link contained into the roads Table (FOREIGN KEY).
  • label: the textual label fully qualifying each House Number.
  • geom: a 3D Point representing the Geometry of each House Number.
    Note #1: also in this case all elevations (Z coordinates) were interpolated by draping the dataset over the same DEM as above.
    Note #2: strictly specking the House Numbers are not part of the Road Network; they are include into the sample/test database just because they'll be useful in some of the examples explained in below paragraphs.
• the house_nr_vw Spatial View is just intended to fully resolve all relational references between house_nr, roads, toponyms and municipalities, thus allowing for easier SQL queries.

3 - Creating VirtualRouting Tables

SELECT CreateRouting('byfoot_data', 'byfoot', 'roads_vw', 'node_from', 'nodeto', 'geom', NULL);

SELECT CreateRouting_GetLastError();
------------------------------------
ToNode Column "nodeto" is not defined in the Input Table

SELECT CreateRouting('byfoot_data', 'byfoot', 'roads_vw', 'node_from', 'node_to', 'geom', NULL);
-------------
1

SELECT CreateRouting_GetLastError();
------------------------------------
NULL

1. byfoot_data: the name of the Network Binary Data Table to be created.
2. byfoot: the name of the VirtualRouting Table to be created.
3. roads_vw: the name of the Spatial Table or Spatial View representing the underlying Network.
   Note: in this case we actually used a Spatial View.
4. node_from: name of the column (in the above Table or View) expected to contain node-from values.
5. node_to: name of the column (in the above Table or View) expected to contain node-to values.
6. geom: name of the column (in the above Table or View) expected to contain Linestrings.
   We could have legitimately passed a NULL value for this argument in the case of a Logical Network.
7. NULL: name of the column (in the above Table or View) expected to contain cost values.
   In this case we have passed a NULL value, and consequently the cost of each Link will be assumed to be represented by the geometric length of the corresponding Linestring.
   Note #1: in the case of Networks based on longitudes and latitudes (aka geographic Reference Systems) the geometry length of all Linestrings will be precisely measured on the ellipsoid by applying the most accurate geodesic formulae and will be consequently expressed in meters. In any other case (projected Reference Systems) lengths will be expressed in the measure unit defined by the Reference System (e.g. meters for UTM projections and feet for NAD-ft projections).
   Note #2: the geom-column and cost-column arguments are never allowed to be NULL at the same time.

CREATE VIRTUAL TABLE test_network USING VirtualNetwork('some_data_table');

CREATE VIRTUAL TABLE test_routing USING VirtualRouting('some_data_table');

SELECT CreateRouting('bycar_data', 'bycar', 'roads_vw', 'node_from', 'node_to', 'geom', 'cost', 'toponym', 1, 1, 'oneway_fromto', 'oneway_tofrom', 0);
--------------------
1

1. bycar_data: same as above.
2. bycar: same as above.
3. roads_vw: same as above.
4. node_from: same as above.
5. node_to: same as above.
6. geom: same as above.
7. cost: same as above. In this case we have referenced a column preloaded with values corresponding to the time measured in seconds required to traverse each Link.
8. toponym: name of the column (in the above Table or View) expected to contain road-name values.
   It could be legitimately set to NULL if all Links are anonymous.
9. 1: a boolean flag intended to specify if the Network must support the A* algorithm or not (set to TRUE by default).
10. 1: a boolean flag intended to specify if all Network's Links are assumed to be bidirectional or not (assumed to be TRUE by default).
11. oneway_fromto: name of the column (in the above Table or View) expected to contain boolean flags specifying if each Link can be traversed in the from-to direction or not.
12. oneway_tofrom: name of the column (in the above Table or View) expected to contain boolean flags specifying if each Link can be traversed in the to-from direction or not.
    Note #1: both from-to and to-from column names can be legitimately set as NULL if no one-way restrictions apply to the current Network.
    Note #2: Networks of the unidirectional type are never enabled to reference one-way columns (they should always be set to NULL).
13. 0: a boolean flag intending an overwrite authorization.
    • If set to FALSE an exception will be raised if the Binary Data Table and/or the VirtualRouting Table do already exist.
    • If set to TRUE eventually existing Tables will be preventively dropped immediately before starting the execution of CreateRouting().

Automatically setting NodeFrom and NodeTo IDs

SELECT CreateRoutingNodes(NULL, 'table_name', 'geom', 'node_from', 'node_to');
_________________________
1

1. NULL: name of the Attached-DB containing the Spatial Table.
   It can be legitimately set to NULL, and in this case the MAIN DB is assumed.
2. table_name: name of the Spatial Table.
3. geom
: name of the column ((in the above Table) containing Linestrings.
4. node_from: name of the column to be added to the above Table and populated with appropriate NodeFrom IDs.
5. node_to: name of the column to be added to the above Table and populated with appropriate NodeTo IDs.
   Note: both NodeFrom and NodeTo columns should not be already defined in the above Table.

back