- RDBMS uses Array data structure
- Network data model uses Graph
- Hierarchal data model uses Trees
In the context of RDBMS (Relational Database Management System), Network Data Model, and Hierarchical Data Model, here are the data structures commonly used:
- RDBMS:
- Tables: In RDBMS, data is organized into tables, where each table consists of rows and columns. This structure is fundamental to relational databases and represents entities and their attributes.
- Indexes: Indexes are used to optimize the retrieval of data by creating a sorted structure that allows for faster lookup of rows based on certain columns.
- Network Data Model:
- Graphs: The network data model can be represented using graph data structures, where nodes represent entities, and edges represent relationships between these entities. This model is more flexible than the hierarchical model as it allows for many-to-many relationships.
- Hierarchical Data Model:
- Trees: The hierarchical data model is represented using tree data structures, where each node represents a record, and edges represent the parent-child relationships between these records. This model organizes data in a top-down structure, where each record has a single parent but can have multiple children.
It’s important to note that while RDBMS primarily uses tables and indexes, the network and hierarchical data models are conceptual models that can be implemented using various data structures, with graphs and trees being the most common representations, respectively.