A method of structuring data or other information so that the units of data storage are connected by a hierarchically defined pathway.
A database that links data using a hierarchical relationship. The data element at the top of the hierarchy is known as the parent element, and there may be several child elements beneath the parent element. The structure that is created resembles a pyramid or an organizational chart.
the first design of databases. Each object (except the root itself) must have a parent and only one parent. IBM used this design before 1970.
a different beast than a relational database
a kind of database management system that links records together in a tree data structure such that each record type has only one owner (e
a database design concept designed along lines of major components composed of a hierarchy of subcomponents, developed to support the Saturn rocket program
stores related information in terms of pre-defined categorical relationships in a "tree-like" fashion. Information is traced from a major group, to a subgroup, and to further subgroups. Much like tracing a family tree, data can be traced through parents along paths through the hierarchy. Users must keep track of the hierarchical structure in order to make use of the data. The relational database provides an alternative means of organizing datasets.
A database management system based on a tree structure allowing a child object to only have one parent object it is related to using record pointers rather than migrating data elements (Foreign Keys).
A database that is organized in a tree structure in which each record has one owner. Navigation to individual records takes place through predetermined access paths.
A method of constructing a database that requires that related record types be linked in tree-like structures, where no child record can have more than one physical parent record.
