relational data structure

relational data structure

[ri′lā·shən·əl ′dad·ə ‚strək·chər]
(computer science)
A type of data structure in which data are represented as tables in which no entry contains more than one value.
References in periodicals archive ?
Deductive systems were originally designed for educational purposes, helping students to translate the relational data structure model in a deductive data model, where "atomic data are arranged in predicates which can be understood as relations, i.e., relational tables" [Saenz-Perez, 2018].
Even if they use digital data from financial statements, it's of limited use because it often is aggregated, so the native hierarchical format and relational data structure are lost when using ASCII files unless they are first restored in the new environment.
After research in Information Technology market we made a choice of using MySQL database with relational data structure. This kind of database could be easily connected through web or intranet with other systems, users etc.
To provide design engineers a truly comprehensive information resource, implementation of a generalized relational data structure is a must.
Although OLAP data and relational data structures have similarities, their differences are significant.

Full browser ?