How is data organized in a relational database?

• A. Tables with rows and columns.
• B. Graphs with nodes and edges.
• C. Documents in a collection.
• D. Key-value pairs.

Answer: (A)

In a relational database, data is organized into tables of rows and columns. Each table represents a set of records that share the same structure: each row is a single record, and each column holds a specific attribute with a defined data type. The power of this arrangement comes from the ability to relate data across tables using keys—a primary key uniquely identifies a row in its table, and foreign keys link to those primary keys in other tables to establish relationships. This tabular layout supports powerful querying (via SQL), data integrity, and normalization to reduce redundancy.

Other data models use different structures: graphs store data as nodes and edges to emphasize relationships; document stores keep semi-structured documents in collections; key-value stores map keys directly to values. The described tables-with-rows-and-columns layout is the distinctive setup of the relational model.