A _____ database does not use pointers or physical links, but instead finds related records by examining the contents of fields. A. Network B. Hierarchical C. Relational D. Object-Oriented E. None of the above

Network
Hierarchical
Relational
Object-Oriented E. None of the above

The correct answer is: C. Relational

A relational database is a database that stores and organizes data in a series of tables. Each table contains a set of rows and columns, and each row represents a single record. The columns in a table represent the attributes of the records, and the rows represent the individual records themselves.

Relational databases are based on the relational model, which was first developed by E.F. Codd in the 1970s. The relational model is a mathematical model that describes how data can be stored and related to each other.

In a relational database, each table is related to other tables through a common field. For example, a table of customers might be related to a table of orders through a field called “customer ID.” This field would contain the ID number of the customer who placed the order.

Relational databases are the most common type of database used today. They are easy to use and understand, and they are very efficient at storing and retrieving data.

The other options are incorrect because they do not describe a relational database.

  • A network database is a database that stores data in a series of nodes. Each node represents a single record, and the nodes are connected to each other through a network of links.
  • A hierarchical database is a database that stores data in a series of levels. The data is organized in a hierarchy, with each level containing data that is related to the data in the levels above it.
  • An object-oriented database is a database that stores data in a series of objects. Each object represents a single entity, and the objects are related to each other through a series of relationships.