Records can have pointers to next-record address, linking records {list, computing}. Records can have indexes. List elements can point to positions in address table {inverted list}. Last list record can point to first record {closed list} {ring, record}. Records can have pointers in both directions. Hierarchies and networks have related data elements. Memories can be lists, with nodes and node links.
Mathematical Sciences>Computer Science>Software>Data Hierarchy
3-Computer Science-Software-Data Hierarchy
Outline of Knowledge Database Home Page
Description of Outline of Knowledge Database
Date Modified: 2022.0224