Index

A C D E F G H I J K L M N O P R S T U V W

A

A* search algorithm for shortest path, 7

active link

checking for, 7

active links, 5.3

ACTIVE column in link table, 5.9.2

active nodes, 5.3

ACTIVE column in node table, 5.9.1

checking for, 7

active paths

checking for, 7

ADD_EDGE function, 4

ADD_ISOLATED_NODE function, 4

ADD_LINEAR_GEOMETRY function, 4

ADD_LINK procedure, 7

ADD_LOOP function, 4

ADD_LRS_NODE procedure, 7

ADD_NODE function, 4

ADD_NODE procedure, 7

ADD_PATH procedure, 7

ADD_POINT_GEOMETRY function, 4

ADD_POLYGON_GEOMETRY function, 4

ADD_SDO_NODE procedure, 7

ADD_TOPO_GEOMETRY_LAYER procedure, 3

adjacent nodes

getting, 7

ALL_PATHS procedure, 7

ALL_SDO_NETWORK_CONSTRAINTS view, 5.10.2

ALL_SDO_NETWORK_METADATA view, 5.10.1

ALL_SDO_NETWORK_USER_DATA view, 5.10.3

ALL_SDO_TOPO_INFO view, 1.7.1

ALL_SDO_TOPO_METADATA view, 1.7.2

API

network data model, 5.11

performance, 5.11

topology data model, 1.8

application programming interface (API)

network data model, 5.11

performance, 5.11

topology data model, 1.8

C

cache

partition, 5.7.3

TopoMap object associated with, 2.1.1

D

degree

of a node, 5.3

DELETE_LINK procedure, 6, 7

DELETE_NODE procedure, 6, 7

DELETE_PATH procedure, 6, 7

DELETE_SUBPATH procedure, 6

DELETE_TOPO_GEOMETRY_LAYER procedure, 3

demo files

network data model, 5.14

DEREGISTER_CONSTRAINT procedure, 6, 7

DESCRIBE SDO_NET_MEM

statements needed, 7

Dijkstra search algorithm for shortest path, 7

directed links, 5.3

directed networks, 5.3

direction of edge, 1.2

DISABLE_REF_CONSTRAINTS procedure, 7

DROP_NETWORK procedure, 6, 7

DROP_TOPO_MAP procedure, 4

DROP_TOPOLOGY procedure, 3

duration, 5.3

LINK_DURATION_COLUMN column in network metadata views, 5.10.1

NODE_DURATION_COLUMN column in network metadata views, 5.10.1

E

edge index

creating for TopoMap object, 4

edge information table, 1.5.1

edge sequences

privileges needed for cross-schema topology editing, 1.10.2

edges

adding, 2.3.1, 4

adding linear geometry, 4

adding loop, 4

changing coordinates, 2.3.4, 4

definition, 1.2

direction, 1.2

finding edges interacting with a query window, 4

getting coordinates of shape points, 4

getting ID numbers of added edges, 4

getting ID numbers of changed edges, 4

getting ID numbers of deleted edges, 4

getting nearest edge for point, 4

getting nearest edge in cache for point, 4

getting nodes on, 4

island, 1.2

isolated, 1.2

loop, 1.2

moving, 2.3.2, 4

removing, 2.3.3, 4

storing information in edge information table, 1.5.1

updating, 2.3.4

ENABLE_REF_CONSTRAINTS procedure, 7

end measure

getting, 7

end node

getting for a link, 7

getting for a path, 7

setting for a link, 7

error handling

topology editing, 2.1.6

examples

network data model, 5.13, 5.14

topology data model (PL/SQL), 1.12

exception handling

topology editing, 2.1.6

F

F0 (face zero, or universe face), 1.2

face index

creating for TopoMap object, 4

face information table, 1.5.3

face sequences

privileges needed for cross-schema topology editing, 1.10.2

faces

adding polygon geometry, 4

definition, 1.2

finding faces interacting with a query window, 4

getting boundary, 4

getting boundary of, 3

getting containing face for point, 4

getting ID numbers of added faces, 4

getting ID numbers of changed faces, 4

getting ID numbers of deleted faces, 4

redefining, 2.3.3

storing information in face information table, 1.5.3

feature table, 1.3

features

creating from geometries, 4

in network application, 5.3, 5.3

FIND_CONNECTED_COMPONENTS function, 7

FIND_CONNECTED_COMPONENTS procedure, 6

FIND_REACHABLE_NODES function, 7

FIND_REACHING_NODES function, 7

function-based indexes

not supported on SDO_TOPO_GEOMETRY columns, 1.11

G

GENERATE_NODE_LEVELS procedure, 6

GENERATE_PARTITION_BLOB procedure, 6

GENERATE_PARTITION_BLOBS procedure, 6

geometry

computing for a path, 6, 7

getting for a link, 7

getting for a path, 7

setting for a link, 7

setting for a node, 7

setting for a path, 7

geometry ID

getting for a link, 7

getting for a node, 7

getting for node, 7

setting for a link, 7

setting for a node, 7

GET_ADJACENT_NODE_IDS function, 7

GET_CHILD_LINKS function, 6, 7

GET_CHILD_NODE_IDS function, 7

GET_CHILD_NODES function, 6

GET_CO_LINK_IDS function, 7

GET_COMPONENT_NO function, 7

GET_CONTAINING_FACE function, 4

GET_COST function, 7, 7, 7

GET_EDGE_ADDITIONS function, 4

GET_EDGE_CHANGES function, 4

GET_EDGE_COORDS function, 4

GET_EDGE_DELETIONS function, 4

GET_EDGE_NODES function, 4

GET_END_MEASURE function, 7

GET_END_NODE_ID function, 7, 7

GET_FACE_ADDITIONS function, 4

GET_FACE_BOUNDARY function, 3, 4

GET_FACE_CHANGES function, 4

GET_FACE_DELETIONS function, 4

GET_GEOM_ID function, 7, 7

GET_GEOMETRY function, 7, 7, 7

GET_GEOMETRY member function, 1.6.3

GET_GEOMETRY_TYPE function, 6

GET_HIERARCHY_LEVEL function, 7

GET_IN_LINK_IDS function, 7

GET_IN_LINKS function, 6

GET_INCIDENT_LINK_IDS function, 7

GET_INVALID_LINKS function, 6

GET_INVALID_NODES function, 6

GET_INVALID_PATHS function, 6

GET_ISOLATED_NODES function, 6

GET_LEVEL function, 7

GET_LINK_COST_COLUMN function, 6

GET_LINK_DIRECTION function, 6

GET_LINK_GEOM_COLUMN function, 6

GET_LINK_GEOMETRY function, 6

GET_LINK_IDS function, 7

GET_LINK_TABLE_NAME function, 6

GET_LINKS_IN_PATH function, 6

GET_LRS_GEOM_COLUMN function, 6

GET_LRS_LINK_GEOMETRY function, 6

GET_LRS_NODE_GEOMETRY function, 6

GET_LRS_TABLE_NAME function, 6

GET_MAX_LINK_ID function, 7

GET_MAX_NODE_ID function, 7

GET_MAX_PATH_ID function, 7

GET_MAX_SUBPATH_ID function, 7

GET_MEASURE function, 7

GET_NAME function, 7, 7, 7

GET_NEAREST_EDGE function, 4

GET_NEAREST_EDGE_IN_CACHE function, 4

GET_NEAREST_NODE function, 4

GET_NEAREST_NODE_IN_CACHE function, 4

GET_NETWORK_TYPE function, 6

GET_NO_OF_HIERARCHY_LEVELS function, 6

GET_NO_OF_LINKS function, 6, 7

GET_NO_OF_NODES function, 6

GET_NODE_ADDITIONS function, 4

GET_NODE_CHANGES function, 4

GET_NODE_COORD function, 4

GET_NODE_DEGREE function, 6

GET_NODE_DELETIONS function, 4

GET_NODE_FACE_STAR function, 4

GET_NODE_GEOM_COLUMN function, 6

GET_NODE_GEOMETRY function, 6

GET_NODE_IDS function, 7

GET_NODE_IN_DEGREE function, 6

GET_NODE_OUT_DEGREE function, 6

GET_NODE_STAR function, 4

GET_NODE_TABLE_NAME function, 6

GET_OUT_LINK_IDS function, 7

GET_OUT_LINKS function, 6

GET_PARENT_LINK_ID function, 7

GET_PARENT_NODE_ID function, 7

GET_PARTITION_SIZE function, 6

GET_PATH_GEOM_COLUMN function, 6

GET_PATH_TABLE_NAME function, 6

GET_PERCENTAGE function, 6

GET_PT function, 6

GET_SIBLING_LINK_IDS function, 7

GET_SIBLING_NODE_IDS function, 7

GET_START_MEASURE function, 7

GET_START_NODE_ID function, 7, 7

GET_STATE function, 7, 7

GET_TGL_OBJECTS member function, 1.6.4

GET_TOPO_ELEMENTS member function, 1.6.5

GET_TOPO_NAME function, 4

GET_TOPO_OBJECTS function, 3

GET_TOPO_TRANSACTION_ID function, 4

GET_TYPE function, 7, 7, 7

getting link IDs, 7

H

heap size

Java, 4, 7

heap size (Java)

setting maximum, 6

hierarchy

network, 5.5

topology geometry layer, 1.4

hierarchy level

getting for a node, 7

setting for a node, 7

history information table, 1.5.5

I

inbound links, 5.3

getting for a node, 7

getting link ID numbers, 6

getting number of for node, 6

incident links

getting for a node, 7

in-degree, 5.3

INITIALIZE_AFTER_IMPORT procedure, 3

INITIALIZE_METADATA procedure, 3

invalid links

getting, 6

invalid nodes

getting, 6

invalid paths

getting, 6

IS_ACTIVE function, 7, 7, 7

IS_CLOSED function, 7

IS_CONNECTED function, 7

IS_HIERARCHICAL function, 6

IS_LINK_IN_PATH function, 6

IS_LOGICAL function, 6, 7, 7, 7

IS_NODE_IN_PATH function, 6

IS_REACHABLE function, 7

IS_SIMPLE function, 7

IS_SPATIAL function, 6

IS_TEMPORARY function, 7, 7, 7

island edge

See isolated edge

island node

See isolated nodes (topology)

isolated edge, 1.2

isolated nodes (network)

definition of, 5.3

getting, 6

isolated nodes (topology)

adding, 4

definition of, 1.2

J

Java client interface for network data model (sdonm), 5.11.2

Java client interface for topology data model (sdotopo), 1.8.2

Java heap size

setting maximum, 6

Java maximum heap size

setting, 4, 7

K

Kruskal algorithm, 7

L

layer

collection, 1.3.2

topology geometry, 1.3, 3

linear geometries

adding, 4

link direction

getting, 6

link geometry

getting, 6

link level

getting, 7

link levels, 5.7.5

link name

getting, 7

setting, 7

link table

definition, 5.9.2

LINK_EXISTS function, 7

links, 7

adding, 7

checking if exists, 7

checking if temporary, 7

child links, 7

co-links, 7

definition, 5.3

deleting, 6, 7

determining if directed, 6

directed, 5.3

direction, 5.3

getting geometry for, 6

getting name, 7

getting parent link, 7

getting percentage of point on link, 6

getting sibling links, 7

invalid, 6

relationship to paths, 5.3

setting cost, 7

setting end node, 7

setting geometry, 7

setting geometry ID, 7

setting hierarchy level, 7

setting measure values, 7

setting name, 7

setting parent link, 7

setting start node, 7

setting state, 7

setting type, 7

state of, 5.3

temporary, 5.3

undirected, 5.3

See also undirected links, inbound links, outbound links

links getting maximum link ID, 7

LIST_NETWORKS function, 7

LIST_TOPO_MAPS function, 4

load on demand

using for editing and analysis, network editing

using partitioning and load on demand, 5.7

load on demand analysis, 5.3

LOAD_CONFIG procedure, 6

LOAD_TOPO_MAP function or procedure, 4

logging level

setting for network operations, 6

logical network, 5.3

creating, 7

SDO_NET_MEM.LINK.IS_LOGICAL function, 7

SDO_NET_MEM.NODE.IS_LOGICAL function, 7

SDO_NET_MEM.PATH.IS_LOGICAL function, 7

LOGICAL_PARTITION procedure, 6

LOGICAL_POWERLAW_PARTITION procedure, 6

loop edge, 1.2

loops

adding, 4

LRS network, 5.3

creating, 7

LRS nodes

adding, 7

LRS_GEOMETRY_NETWORK function, 6

M

MAKE_TEMPORARY procedure, 7

MCST_LINK function, 7

measure value

getting for a node, 7

setting for a node, 7

measure values

setting for a link, 7

metadata

initializing for a topology, 3

minimum cost path, 5.3

minimum cost spanning tree, 5.3

definition, 7

minimum cost spanning tree (MCST)

finding, 7

MOVE_EDGE procedure, 4

MOVE_ISOLATED_NODE procedure, 4

MOVE_NODE procedure, 4

N

naming considerations

Spatial table and column names, 1.5, 5.9

nearest edge

getting for point, 4

getting in cache for point, 4

nearest node

getting for point, 4

getting in cache for point, 4

NEAREST_NEIGHBORS function, 7

network analysis

using a network memory object for, 5.8

using the load on demand approach, 5.7

network constraints, 5.6

ALL_SDO_NETWORK_CONSTRAINTS view, 5.10.2

deregistering, 6

registering, 6

USER_SDO_NETWORK_CONSTRAINTS view, 5.10.2

network data model

application programming interface (API), 5.11

performance, 5.11

concepts, 5.3

examples, 5.13

overview, 5

steps for using, 5.2

subprogram reference information, 6, 7

tables for, 5.9

network editing

using a network memory object for, 5.8

Network Editor

interface illustration, 5.1

network memory object

creating, 7

using for editing and analysis, 5.8

network schema

validating, 7

NETWORK_EXISTS function, 6

networks

analyzing, 5.8

directed, 5.3

dropping, 7

editing, 5.8

hierarchical, 5.5

logical, 5.3

partitioned, 5.3

spatial, 5.3

undirected, 5.3

writing, 7

node

getting inbound links, 7

node face star

getting for node, 4

node geometry

getting, 6

node information table, 1.5.2

node name

getting, 7

setting, 7

node sequences

privileges needed for cross-schema topology editing, 1.10.2

node star

getting for node, 4

node table

definition, 5.9.1

nodes

adding, 2.2.1, 4, 7

adding isolated (topology), 4

adding LRS node, 7

adding point geometry, 4

adding SDO node, 7

checking if active, 7

checking if temporary, 7

definition, 1.2, 5.3

degree, 5.3

deleting, 6, 7

generating node levels for multilevel network, 6

getting adjacent nodes, 7

getting child nodes, 7

getting component number, 7

getting coordinates of, 4

getting cost, 7

getting geometry, 6, 7

getting geometry ID, 7

getting hierarchy level, 7

getting ID numbers of added nodes, 4

getting ID numbers of changed nodes, 4

getting ID numbers of deleted nodes, 4

getting incident links, 7

getting maximum node ID, 7

getting measure value, 7

getting name, 7

getting nearest node for point, 4

getting nearest node in cache for point, 4

getting node face star, 4

getting node star, 4

getting number of, 6

getting outbound links, 7

getting parent node, 7

getting sibling nodes, 7

getting state, 7

getting type, 7

invalid, 6

island, 1.2

isolated (network), 5.3, 6

isolated (topology), 1.2

making temporary, 7

moving, 2.2.2, 4

moving isolated nodes (topology), 4

obsolete, 2.2.4, 4

reachable, 5.3

reaching, 5.3

removing, 2.2.3, 4

removing obsolete, 2.2.4, 4

setting component number, 7

setting cost, 7

setting geometry, 7

setting geometry ID, 7

setting hierarchy level, 7

setting measure value, 7

setting name, 7

setting parent node, 7

setting state, 7

setting type, 7

state of, 5.3

storing information in node information table, 1.5.2

temporary, 5.3

O

obsolete nodes

removing, 2.2.4, 4

open path

definition, 7

specifying for TSP, 7

operators

topology data model, 1.8.1

outbound links, 5.3

getting for a node, 7

getting link ID numbers, 6

getting number of for node, 6

out-degree, 5.3

OutOfMemoryError exception

raising maximum heap size, 4, 7

P

parent layer, 1.4

parent link

getting, 7

setting, 7

parent node, 5.5

getting ID, 7

setting for a node, 7

partition BLOB

generating, 6

partition BLOBs, 5.3

generating, 6

generating and loading from, 5.7.2

partition cache, 5.3, 5.7.3

loading configuration, 6

partition size

getting, 6

partition table

definition, 5.9.6, 5.9.7, 5.9.8

partitioned network, 5.3

partitions

caching, 5.7.3

partition table, 5.9.6, 5.9.7, 5.9.8

partitioning a network, 6, 6, 6

resident, 5.7.3

using for editing and analysis, 5.7

path ID

setting, 7

path name

getting, 7

setting, 7

path table

definition, 5.9.3

path type

setting, 7

path-link table

definition, 5.9.4

paths, 7

adding, 7

checking if active, 7

checking if closed, 7

checking if connected, 7

checking if in logical network, 7

checking if simple or complex, 7

checking if temporary, 7

complex, 5.9.3

computing the geometry, 6, 7

definition, 5.3

deleting, 6, 7

getting cost, 7

getting end node, 7

getting geometry, 7

getting name, 7

getting node IDs, 7

getting number of links, 7

getting start node, 7

getting type, 7

invalid, 6

minimum cost, 5.3

returning all, 7

setting geometry, 7

setting ID, 7

setting name, 7

setting type, 7

simple, 5.9.3

subpaths, 5.3.1

temporary, 5.3

paths getting maximum path ID, 7

performance

network data model API, 5.11

PL/SQL examples

network data model, 5.13

point geometries

adding, 4

points

getting point at percentage on link, 6

polygon geometries

adding, 4

power law networks, 6

precomputed analysis results, 5.7.6

PREPARE_FOR_EXPORT procedure, 3

primitives

See topological elements

R

reachable nodes, 5.3

reaching nodes, 5.3

READ_NETWORK procedure, 7

README file

for Spatial, GeoRaster, and topology and network data models, 1.13, 5.15

read-only TopoMap objects, 2.1.1

reference path

definition, 5.3.1

referential constraints

creating using SDO_NET_MEM.NETWORK_MANAGER.CREATE_REF_CONSTRAINTS, 7

disabling using SDO_NET_MEM.NETWORK_MANAGER.DISABLE_REF_CONSTRAINTS, 7

enabling using SDO_NET_MEM.NETWORK_MANAGER.ENABLE_REF_CONSTRAINTS, 7

REGISTER_CONSTRAINT procedure, 6, 7

RELATE function, 3

relationship information table, 1.5.4

REMOVE_EDGE procedure, 4

REMOVE_NODE procedure, 4

REMOVE_OBSOLETE_NODES procedure, 4

resident partitions, 5.7.3

ROLLBACK_TOPO_MAP procedure, 4

S

scale-free (power law) networks, 6

SDO network, 5.3

creating, 7

SDO nodes

adding, 7

SDO_EDGE_ARRAY type, 1.6.7

SDO_GEOMETRY_NETWORK function, 6

SDO_LIST_TYPE type, 1.6.6

SDO_NET package

COMPUTE_PATH_GEOMETRY, 6

COPY_NETWORK, 6

CREATE_LINK_TABLE, 6

CREATE_LOGICAL_NETWORK, 6

CREATE_LRS_NETWORK, 6

CREATE_LRS_TABLE, 6

CREATE_NODE_TABLE, 6

CREATE_PARTITION_TABLE, 6

CREATE_PATH_LINK_TABLE, 6

CREATE_PATH_TABLE, 6

CREATE_SDO_NETWORK, 6

CREATE_SUBPATH_TABLE, 6

CREATE_TOPO_NETWORK, 6

DELETE_LINK, 6

DELETE_NODE, 6

DELETE_PATH, 6

DELETE_SUBPATH, 6

DEREGISTER_CONSTRAINT, 6

DROP_NETWORK, 6

FIND_CONNECTED_COMPONENTS, 6

GENERATE_NODE_LEVELS, 6

GENERATE_PARTITION_BLOB, 6

GENERATE_PARTITION_BLOBS, 6

GET_CHILD_LINKS, 6

GET_CHILD_NODES, 6

GET_GEOMETRY_TYPE, 6

GET_IN_LINKS, 6

GET_INVALID_LINKS, 6

GET_INVALID_NODES, 6

GET_INVALID_PATHS, 6

GET_ISOLATED_NODES, 6

GET_LINK_COST_COLUMN, 6

GET_LINK_DIRECTION, 6

GET_LINK_GEOM_COLUMN, 6

GET_LINK_GEOMETRY, 6

GET_LINK_TABLE_NAME, 6

GET_LINKS_IN_PATH, 6

GET_LRS_GEOM_COLUMN, 6

GET_LRS_LINK_GEOMETRY, 6

GET_LRS_NODE_GEOMETRY, 6

GET_LRS_TABLE_NAME, 6

GET_NETWORK_TYPE, 6

GET_NO_OF_HIERARCHY_LEVELS, 6

GET_NO_OF_LINKS, 6

GET_NO_OF_NODES, 6

GET_NODE_DEGREE, 6

GET_NODE_GEOM_COLUMN, 6

GET_NODE_GEOMETRY, 6

GET_NODE_IN_DEGREE, 6

GET_NODE_OUT_DEGREE, 6

GET_NODE_TABLE_NAME, 6

GET_OUT_LINKS, 6

GET_PARTITION_SIZE, 6

GET_PATH_GEOM_COLUMN, 6

GET_PATH_TABLE_NAME, 6

GET_PERCENTAGE, 6

GET_PT, 6

IS_HIERARCHICAL, 6

IS_LINK_IN_PATH, 6

IS_LOGICAL, 6

IS_NODE_IN_PATH, 6

IS_SPATIAL, 6

LOAD_CONFIG, 6

LOGICAL_PARTITION, 6

LOGICAL_POWERLAW_PARTITION, 6

LRS_GEOMETRY_NETWORK, 6

NETWORK_EXISTS, 6

reference information, 6

REGISTER_CONSTRAINT, 6

SDO_GEOMETRY_NETWORK, 6

SET_LOGGING_LEVEL, 6

SET_MAX_JAVA_HEAP_SIZE, 6

SPATIAL_PARTITION, 6

TOPO_GEOMETRY_NETWORK, 6

VALIDATE_LINK_SCHEMA, 6

VALIDATE_LRS_SCHEMA, 6

VALIDATE_NETWORK, 6

VALIDATE_NODE_SCHEMA, 6

VALIDATE_PARTITION_SCHEMA, 6

VALIDATE_PATH_SCHEMA, 6

VALIDATE_SUBPATH_SCHEMA, 6

SDO_NET_MEM package

reference information, 7

SET_MAX_MEMORY_SIZE, 7

statements for describing, 7

using for editing and analysis, 5.8

SDO_NET_MEM.LINK package

GET_CHILD_LINKS, 7

GET_CO_LINK_IDS, 7

GET_COST, 7

GET_END_MEASURE, 7

GET_END_NODE_ID, 7

GET_GEOM_ID, 7

GET_GEOMETRY, 7

GET_LEVEL, 7

GET_NAME, 7

GET_PARENT_LINK_ID, 7

GET_SIBLING_LINK_IDS, 7

GET_START_MEASURE, 7

GET_START_NODE_ID, 7

GET_STATE, 7

GET_TYPE, 7

IS_ACTIVE, 7

IS_LOGICAL, 7

IS_TEMPORARY, 7

SET_COST, 7

SET_END_NODE, 7

SET_GEOM_ID, 7

SET_GEOMETRY, 7

SET_LEVEL, 7

SET_MEASURE, 7

SET_NAME, 7

SET_PARENT_LINK, 7

SET_START_NODE, 7

SET_STATE, 7

SET_TYPE, 7

SDO_NET_MEM.NETWORK package

ADD_LINK, 7

ADD_LRS_NODE, 7

ADD_NODE, 7

ADD_PATH, 7

ADD_SDO_NODE, 7

DELETE_LINK, 7

DELETE_NODE, 7

DELETE_PATH, 7

GET_MAX_LINK_ID, 7

GET_MAX_NODE_ID, 7

GET_MAX_PATH_ID, 7

GET_MAX_SUBPATH_ID, 7

SDO_NET_MEM.NETWORK_MANAGER package

ALL_PATHS, 7

CREATE_LOGICAL_NETWORK, 7

CREATE_LRS_NETWORK, 7

CREATE_REF_CONSTRAINTS, 7

CREATE_SDO_NETWORK, 7

DEREGISTER_CONSTRAINT, 7

DISABLE_REF_CONSTRAINTS, 7

DROP_NETWORK, 7

ENABLE_REF_CONSTRAINTS, 7

FIND_CONNECTED_COMPONENTS, 7

FIND_REACHABLE_NODES, 7

FIND_REACHING_NODES, 7

IS_REACHABLE, 7

LIST_NETWORKS, 7

MCST_LINK, 7

NEAREST_NEIGHBORS, 7

READ_NETWORK, 7

REGISTER_CONSTRAINT, 7

SHORTEST_PATH, 7

SHORTEST_PATH_DIJKSTRA, 7

TSP_PATH, 7

VALIDATE_NETWORK_SCHEMA, 7

WITHIN_COST, 7

WRITE_NETWORK, 7

SDO_NET_MEM.NODE package

GET_ADJACENT_NODE_IDS, 7

GET_CHILD_NODE_IDS, 7

GET_COMPONENT_NO, 7

GET_COST, 7

GET_GEOM_ID, 7

GET_GEOMETRY, 7

GET_HIERARCHY_LEVEL, 7

GET_IN_LINK_IDS, 7

GET_INCIDENT_LINK_IDS, 7

GET_MEASURE, 7

GET_NAME, 7

GET_OUT_LINK_IDS, 7

GET_PARENT_NODE_ID, 7

GET_SIBLING_NODE_IDS, 7

GET_STATE, 7

GET_TYPE, 7

IS_ACTIVE, 7

IS_LOGICAL, 7

IS_TEMPORARY, 7

LINK_EXISTS, 7

MAKE_TEMPORARY, 7

SET_COMPONENT_NO, 7

SET_COST, 7

SET_GEOM_ID, 7

SET_GEOMETRY, 7

SET_HIERARCHY_LEVEL, 7

SET_MEASURE, 7

SET_NAME, 7

SET_PARENT_NODE, 7

SET_STATE, 7

SET_TYPE, 7

SDO_NET_MEM.PATH package

COMPUTE_GEOMETRY, 7

GET_COST, 7

GET_END_NODE_ID, 7

GET_GEOMETRY, 7

GET_LINK_IDS, 7

GET_NAME, 7

GET_NO_OF_LINKS, 7

GET_NODE_IDS, 7

GET_START_NODE_ID, 7

GET_TYPE, 7

IS_ACTIVE, 7

IS_CLOSED, 7

IS_CONNECTED, 7

IS_LOGICAL, 7

IS_SIMPLE, 7

IS_TEMPORARY, 7

SET_GEOMETRY, 7

SET_NAME, 7

SET_PATH_ID, 7

SET_TYPE, 7

SDO_NUMBER_ARRAY type, 1.6.7

SDO_TGL_OBJECT type, 1.6.2.2

SDO_TGL_OBJECT_ARRAY type, 1.6.2.2

SDO_TOPO package

ADD_TOPO_GEOMETRY_LAYER, 3

CREATE_TOPOLOGY, 3

DELETE_TOPO_GEOMETRY_LAYER, 3

DROP_TOPOLOGY, 3

GET_FACE_BOUNDARY, 3

GET_TOPO_OBJECTS, 3

INITIALIZE_AFTER_IMPORT, 3

INITIALIZE_METADATA, 3

PREPARE_FOR_EXPORT, 3

reference information, 3

RELATE, 3

SDO_TOPO_GEOMETRY constructors, 1.6.2

SDO_TOPO_GEOMETRY member functions

GET_GEOMETRY, 1.6.3

GET_TGL_OBJECTS, 1.6.4

GET_TOPO_ELEMENTS, 1.6.5

SDO_TOPO_GEOMETRY type, 1.6.1

SDO_TOPO_MAP package

ADD_EDGE, 4

ADD_ISOLATED_NODE, 4

ADD_LINEAR_GEOMETRY, 4

ADD_LOOP, 4

ADD_NODE, 4

ADD_POINT_GEOMETRY, 4

ADD_POLYGON_GEOMETRY, 4

CHANGE_EDGE_COORDS, 4

CLEAR_TOPO_MAP, 4

COMMIT_TOPO_MAP, 4

CREATE_EDGE_INDEX, 4

CREATE_FACE_INDEX, 4

CREATE_FEATURE, 4

CREATE_TOPO_MAP, 4

DROP_TOPO_MAP, 4

GET_CONTAINING_FACE, 4

GET_EDGE_ADDITIONS, 4

GET_EDGE_CHANGES, 4

GET_EDGE_COORDS, 4

GET_EDGE_DELETIONS, 4

GET_EDGE_NODES, 4

GET_FACE_ADDITIONS, 4

GET_FACE_BOUNDARY, 4

GET_FACE_CHANGES, 4

GET_FACE_DELETIONS, 4

GET_NEAREST_EDGE, 4

GET_NEAREST_EDGE_IN_CACHE, 4

GET_NEAREST_NODE, 4

GET_NEAREST_NODE_IN_CACHE, 4

GET_NODE_ADDITIONS, 4

GET_NODE_CHANGES, 4

GET_NODE_COORD, 4

GET_NODE_DELETIONS, 4

GET_NODE_FACE_STAR, 4

GET_NODE_STAR, 4

GET_TOPO_NAME, 4

GET_TOPO_TRANSACTION_ID, 4

LIST_TOPO_MAPS, 4

LOAD_TOPO_MAP, 4

MOVE_EDGE, 4

MOVE_ISOLATED_NODE, 4

MOVE_NODE, 4

reference information, 4

REMOVE_EDGE, 4

REMOVE_NODE, 4

REMOVE_OBSOLETE_NODES, 4

ROLLBACK_TOPO_MAP, 4

SEARCH_EDGE_RTREE_TOPO_MAP, 4

SEARCH_FACE_RTREE_TOPO_MAP, 4

SET_MAX_MEMORY_SIZE, 4

UPDATE_TOPO_MAP, 4

VALIDATE_TOPO_MAP, 4

VALIDATE_TOPOLOGY, 4

SDO_TOPO_OBJECT type, 1.6.2.1

SDO_TOPO_OBJECT_ARRAY type, 1.6.2.1

sdonm Java client interface, 5.11.2

sdotopo Java client interface, 1.8.2

SEARCH_EDGE_RTREE_TOPO_MAP function, 4

SEARCH_FACE_RTREE_TOPO_MAP function, 4

sequences

node, edge, and face

privileges needed for cross-schema topology editing, 1.10.2

SET_COMPONENT_NO procedure, 7

SET_COST procedure, 7, 7

SET_END_NODE procedure, 7

SET_GEOM_ID procedure, 7, 7

SET_GEOMETRY procedure, 7, 7, 7

SET_HIERARCHY_LEVEL procedure, 7

SET_LEVEL procedure, 7

SET_LOGGING_LEVEL procedure, 6

SET_MAX_JAVA_HEAP_SIZE procedure, 6

SET_MAX_MEMORY_SIZE procedure, 4, 7

SET_MEASURE procedure, 7, 7

SET_NAME procedure, 7, 7, 7

SET_PARENT_LINK procedure, 7

SET_PARENT_NODE procedure, 7

SET_PATH_ID procedure, 7

SET_START_NODE procedure, 7

SET_STATE procedure, 7, 7

SET_TYPE procedure, 7, 7, 7

SHORTEST_PATH function, 7

SHORTEST_PATH_DIJKSTRA function, 7

sibling links, 5.5

getting, 7

sibling nodes, 5.5

getting, 7

simple path, 5.9.3

checking, 7

spanning tree, 5.3

minimum cost, 5.3

spatial network, 5.3

SPATIAL_PARTITION procedure, 6

star

node, 4

node face, 4

start measure

getting for a link, 7

start node

getting for a link, 7

getting in a path, 7

setting for a link, 7

state, 5.3

getting for a link, 7

getting for a node, 7

setting for a link, 7

setting for a node, 7

subpath table

definition, 5.9.5

subpaths

CREATE_SUBPATH_TABLE procedure, 6

definition, 5.3.1

deleting, 6

subpath table, 5.9.5

subpaths getting maximum subpath ID, 7

T

temporary links, 5.3

checking, 7

temporary nodes, 5.3

checking for, 7

making, 7

temporary paths, 5.3

checking for, 7

TG_ID attribute of SDO_TOPO_GEOMETRY type, 1.6.1

TG_LAYER_ID attribute of SDO_TOPO_GEOMETRY type, 1.6.1

TG_TYPE attribute of SDO_TOPO_GEOMETRY type, 1.6.1

tolerance

in the topology data model, 1.2.1

TOPO_GEOMETRY_NETWORK function, 6

topo_map parameter

SDO_TOPO subprograms, 2.1.3

topological elements

definition (nodes, edges, faces), 1.3

topology

clearing map, 4

committing map, 4

creating, 3

creating edge index, 4

creating face index, 4

creating map, 4

deleting (dropping), 3

deleting (dropping) map, 4

editing, 2

export information table format, 1.9

exporting

preparing for, 3

getting name from TopoMap object, 4

hierarchy of geometry layers, 1.4

importing

initializing after, 3

initializing metadata, 3

loading into TopoMap object, 4

updating, 4

validating, 4

topology data model

application programming interface (API), 1.8

concepts, 1.2

overview, 1

PL/SQL example, 1.12

steps for using, 1.1

subprogram reference information, 3, 4

topology data types, 1.6

topology export information table, 1.9

topology geometry

definition, 1.3

layer, 1.3

topology geometry layer

adding, 3

definition, 1.3

deleting, 3

hierarchical relationships in, 1.4

topology geometry network, 5.3

topology maps

listing, 4

loading, 4

rolling back, 4

validating, 4

U

undirected links, 5.3

undirected networks, 5.3

universe face (F0), 1.2

updatable TopoMap objects, 2.1.1

UPDATE_TOPO_MAP procedure, 4

USER_SDO_NETWORK_CONSTRAINTS view, 5.10.2

USER_SDO_NETWORK_METADATA view, 5.10.1

USER_SDO_NETWORK_USER_DATA view, 5.10.3

USER_SDO_TOPO_INFO view, 1.7.1

USER_SDO_TOPO_METADATA view, 1.7.2

user-defined data, 5.3

ALL_SDO_NETWORK_USER_DATA view, 5.10.3

USER_SDO_NETWORK_USER_DATA view, 5.10.3

V

VALIDATE_LINK_SCHEMA function, 6

VALIDATE_LRS_SCHEMA function, 6

VALIDATE_NETWORK function, 6

VALIDATE_NETWORK_SCHEMA function, 7

VALIDATE_NODE_SCHEMA function, 6

VALIDATE_PARTITION_SCHEMA function, 6

VALIDATE_PATH_SCHEMA function, 6

VALIDATE_SUBPATH_SCHEMA function, 6

VALIDATE_TOPO_MAP function, 4

VALIDATE_TOPOLOGY procedure, 4

vertex (node), 5.3

W

WITHIN_COST function, 7

WRITE_NETWORK procedure, 7