A database structure that organizes data in a parent-child relationship; all the relationships among the data items must be determined during the design phase. In a network structure, a child can have more than one parent or no parent at all.
An organization method that allows information relationships to be expressed.
A database organization method that allows for data relationships in a net-like form. A single data element can point to multiple data elements and can itself be pointed to by other data elements. Contrast with relational database.
a database (like IDMS) that is organized in multiple tree structures, in which each record has one or more owners. Navigation to individual records takes place through predetermined access paths.
second design of databases after hierarchical ones. Each object can have several pointers to other objects to denote relationships. This creates a mesh of relationships and hence the name "network".
A hierarchal relationship but one in which the child record may have more than one parent record. EG: Animals: Mammals: Canines: Dogs and Dogs: Companions: Function.
an obsolete database concept similar to hierarchical containing multiple flat files
A database management system based on a tree structure allowing a child object to have more than one parent object it is related to using record pointers rather than migrating data elements (Foreign Keys).
The DIGITAL TCP/IP Services for OpenVMS database that allows users to refer to networks by name rather than network number; contains network names, IP addresses for the networks, and any alias names for the networks.
