Data model: Difference between revisions

Revision as of 09:47, 21 August 2025

Latest revision as of 11:53, 21 August 2025

Line 70:

: The hierarchical model is similar to the network model except that links in the hierarchical model form a tree structure, while the network model allows arbitrary graph.

; [[Network model]]

: The [[network model]], also [[graph model]], organizes data using two fundamental constructs, called records and sets. Records (or nodes) contain fields (i.e. attributes), and sets (or edges) define one-to-many, many-to-many and many-to-one relationships between records: one owner, many members. The network data model is an abstraction of the design concept used in the implementation of databases. Network models emphasise interconnectedness, making them ideal for applications where relationships are crucial, like social networks or recommendation systems. This structure allows for efficient querying of relationships without expensive joins. Query languages relying on this database model include [[GraphQL]] used in [[Apollo]], [[Hygraph]], [[Shopify]], [[Cypher]] used in [[Neo4j]], [[Gremlin]] used in [[Apache ThinkerPop]], [[SPARQL]] used for Resource Description Framework (RDF) data.

; [[Relational model]]

: is a database model based on first-order predicate logic. Its core idea is to describe a database as a collection of predicates over a finite set of predicate variables, describing constraints on the possible values and combinations of values. The power of the relational data model lies in its mathematical foundations and a simple user-level paradigm.