What kind of database consists of tables that store categorized data?

A relational database is characterized by its use of tables to store data that is organized into rows and columns. This structure allows for the categorization of data, where each table can represent a different entity, such as customers, products, or orders. The relationships between different tables can also be established through keys, enabling complex queries and data manipulation.

In a relational database, data can be normalized, which helps reduce redundancy and ensures data integrity. The use of structured query language (SQL) facilitates the retrieval and management of data across these interconnected tables. This design allows for efficient data retrieval and is particularly effective for applications that require handling large volumes of structured data.

Other types of databases, such as flat file databases, store data in a single file, making them less structured and harder to query for relationships among different data categories. A network database, while more flexible than a flat file structure, organizes data in a network configuration rather than in tables, which complicates data interactions. Object-oriented databases store data as objects rather than in a tabular form, focusing more on data representation and behaviors than strict categorization. Thus, the relational database's table structure is what distinctly categorizes it as the correct answer.