Databases power modern applications by enabling efficient storage, retrieval, and management of data. From personal apps to complex enterprise systems, choosing the right type of database is essential.
Databases can be classified based on their structure, usage, storage methods and intended application. Understanding these types will help us choose the best database based on our requirement.
1. Hierarchical Databases
Hierarchical databases organize data in a tree-like structure, where each parent record can have multiple child records. This model works well for scenarios where data follows a predefined hierarchical relationship, where data is arranged in levels or ranks.
Hierarchical Database ExampleFor example, in a university, "University" is at the top level, while "Departments" and "Administration" are at lower levels, even though they are distinct entities. This structure can also be viewed as a parent-child relationship, where each parent record can have multiple child records, but a child record can only have one parent. As more data are added, the structure expands like a tree.
- Example: IBM's Information Management System (IMS) is a well-known hierarchical database.
2. Network Databases
A network databases build on the hierarchical model but allow child records to be linked to multiple parent records, creating a web-like structure of interconnected data. This results in a more flexible structure, often referred to as a graph model, where entities can be connected in many different ways.
For example: club<---->students. In a University database, a student can join multiple clubs and a club can have multiple students. This model is ideal for complex frameworks as it effectively represents many-to-many relationships. Additionally, its structure simplifies the use of certain database management languages.
- Example: The Integrated Data Store (IDS) is a well-known example of a network database.
3. Object-Oriented Databases
Object-oriented databases are based on the principles of object-oriented programming (OOP), where data is stored as objects. These objects include attributes (data) and methods (functions), making them easily referenced and manipulated. These databases are designed to handle complex data structures such as multimedia, graphics, and large files.
Object-Oriented ExampleFor instance, a "Person" object in the database could include attributes like Name and Address and methods like getLatestAddress() to retrieve information. This approach reduces the workload on the database by allowing objects to be reused and linked directly, streamlining data access and manipulation. Each object behaves as an instance of thedatabase model, enabling efficient operations.
A practical example of this model is the Berkeley DB software library, which is designed for fast and efficient query responses in embedded systems. Object-oriented databases are especially useful for applications involving complex data types or multimedia content.
4. Relational Databases
Relational databases are the most widely used type of database today. They store data in tables, with rows representing records and columns representing attributes of the records. In these databases, every piece of information has a relationship with every other piece of information. This is on account of every data value in the database having a unique identity in the form of a record. Note that all the data are tabulated in this model.
Therefore, every row of data in the database is linked with another row using a primary key. Similarly, every table is linked with another table using a foreign key. Refer to the diagram below and notice how the concept of 'Keys' is used to link two tables.
Relational Database ExampleDue to this introduction of tables to organize data, it has become exceedingly popular. In consequence, they are widely integrated into Web-App interfaces to serve as ideal repositories for user data.
What makes it further interesting is the ease in mastering it, since the language used to interact with the database is simple (SQL in this case) and easy to comprehend. In Relational databases, scaling and traversing through data is quite a lightweight task in comparison to Hierarchical Databases.
- Example: MySQL, PostgreSQL, and Oracle Database are some popular relational databases.
5. Cloud Databases
A cloud database operates in a virtual environment hosted on cloud computing platforms. It is designed for storing, managing, and executing data over the internet, providing flexibility and scalability. Cloud databases are widely used for applications requiring dynamic workloads, as they eliminate the need for on-premises infrastructure.
Common cloud services for accessing and managing databases include SaaS (Software as a Service) and PaaS (Platform as a Service), which simplify database operations for businesses. Popular cloud platforms offering database services include:
- Amazon Web Services (AWS)
- Google Cloud Platform (GCP)
- Microsoft Azure
- ScienceSoft, etc.
6. Centralized Databases
A centralized database is a database stored and managed at a single location, such as a central server or data center. It ensures higher security and consistency as all data are maintained in one place, making it easier to control and manage.
Users can access the database remotely to fetch or update information. Centralized databases are commonly used in enterprise systems where data consistency and security are critical. However, scalability and performance limitations should be carefully considered.
7. Personal Databases
A personal database is a small-scale database designed for a single user, typically used on personal computers or mobile devices. These databases are ideal for managing individual data like contacts, budgets, notes, or schedules. They are lightweight, easy to use, and require minimal database administration, making them accessible for non-technical users. Examples are:
- Microsoft Access: A simple database solution for personal or small business needs.
- SQLite: A lightweight, self-contained database commonly used in mobile and desktop applications.
8. Operational Databases
An operational database is designed to manage and process real-time data for daily operations within organizations and businesses. It allows users to create, update, and delete data efficiently, ensuring that the database reflects current activities and transactions.
These databases handle live transactions and provide quick access to up-to-date data. SAP HANA is an example of an operational database used for high-speed transactions and analytics.
9. NoSQL Databases
A NoSQL database (short for "non-SQL" or "non-relational") provides a mechanism for storing and retrieving data that does not rely on traditional table-based relational models. Instead, it uses flexible data models like key-value pairs, documents, column families, or graphs, making it ideal for handling unstructured, semi-structured, and structured data.
NoSQL databases are known for their simplicity of design, horizontal scalability (adding more servers for scaling), and high availability. Unlike relational databases, their data structures allow faster operations in certain use cases. MongoDB, for instance, is a widely used document-based NoSQL database.
Real World Application of Database
Databases are used in most modern applications, whether the database is on our personal phone, computer or the internet. An operational database system will store much of the data an application needs to function, keeping the data organized and allowing users to access the data.
If an eCommerce application was created, there will be some data that the application would access and store in the operational database system, such as:
- Customer data: like usernames, email addresses, and preferences, and etc.
- Business data: like product properties, prices, reviews and ratings, , and etc.
- Relationship data: a customer can view multiple products, and vice versa.
Similar Reads
DBMS Tutorial – Learn Database Management System Database Management System (DBMS) is a software used to manage data from a database. A database is a structured collection of data that is stored in an electronic device. The data can be text, video, image or any other format.A relational database stores data in the form of tables and a NoSQL databa
7 min read
Basic of DBMS
Entity Relationship Model
Introduction of ER ModelThe Entity-Relationship Model (ER Model) is a conceptual model for designing a databases. This model represents the logical structure of a database, including entities, their attributes and relationships between them. Entity: An objects that is stored as data such as Student, Course or Company.Attri
10 min read
Structural Constraints of Relationships in ER ModelStructural constraints, within the context of Entity-Relationship (ER) modeling, specify and determine how the entities take part in the relationships and this gives an outline of how the interactions between the entities can be designed in a database. Two primary types of constraints are cardinalit
5 min read
Generalization, Specialization and Aggregation in ER ModelUsing the ER model for bigger data creates a lot of complexity while designing a database model, So in order to minimize the complexity Generalization, Specialization and Aggregation were introduced in the ER model. These were used for data abstraction. In which an abstraction mechanism is used to h
4 min read
Introduction of Relational Model and Codd Rules in DBMSThe Relational Model is a fundamental concept in Database Management Systems (DBMS) that organizes data into tables, also known as relations. This model simplifies data storage, retrieval, and management by using rows and columns. Codd’s Rules, introduced by Dr. Edgar F. Codd, define the principles
14 min read
Keys in Relational ModelIn the context of a relational database, keys are one of the basic requirements of a relational database model. Keys are fundamental components that ensure data integrity, uniqueness and efficient access. It is widely used to identify the tuples(rows) uniquely in the table. We also use keys to set u
6 min read
Mapping from ER Model to Relational ModelConverting an Entity-Relationship (ER) diagram to a Relational Model is a crucial step in database design. The ER model represents the conceptual structure of a database, while the Relational Model is a physical representation that can be directly implemented using a Relational Database Management S
7 min read
Strategies for Schema design in DBMSThere are various strategies that are considered while designing a schema. Most of these strategies follow an incremental approach that is, they must start with some schema constructs derived from the requirements and then they incrementally modify, refine or build on them. What is Schema Design?Sch
6 min read
Relational Model
Introduction of Relational Algebra in DBMSRelational Algebra is a formal language used to query and manipulate relational databases, consisting of a set of operations like selection, projection, union, and join. It provides a mathematical framework for querying databases, ensuring efficient data retrieval and manipulation. Relational algebr
9 min read
SQL Joins (Inner, Left, Right and Full Join)SQL joins are fundamental tools for combining data from multiple tables in relational databases. For example, consider two tables where one table (say Student) has student information with id as a key and other table (say Marks) has information about marks of every student id. Now to display the mar
4 min read
Join operation Vs Nested query in DBMSThe concept of joins and nested queries emerged to facilitate the retrieval and management of data stored in multiple, often interrelated tables within a relational database. As databases are normalized to reduce redundancy, the meaningful information extracted often requires combining data from dif
3 min read
Tuple Relational Calculus (TRC) in DBMSTuple Relational Calculus (TRC) is a non-procedural query language used to retrieve data from relational databases by describing the properties of the required data (not how to fetch it). It is based on first-order predicate logic and uses tuple variables to represent rows of tables.Syntax: The basi
4 min read
Domain Relational Calculus in DBMSDomain Relational Calculus (DRC) is a formal query language for relational databases. It describes queries by specifying a set of conditions or formulas that the data must satisfy. These conditions are written using domain variables and predicates, and it returns a relation that satisfies the specif
4 min read
Relational Algebra
Introduction of Relational Algebra in DBMSRelational Algebra is a formal language used to query and manipulate relational databases, consisting of a set of operations like selection, projection, union, and join. It provides a mathematical framework for querying databases, ensuring efficient data retrieval and manipulation. Relational algebr
9 min read
SQL Joins (Inner, Left, Right and Full Join)SQL joins are fundamental tools for combining data from multiple tables in relational databases. For example, consider two tables where one table (say Student) has student information with id as a key and other table (say Marks) has information about marks of every student id. Now to display the mar
4 min read
Join operation Vs Nested query in DBMSThe concept of joins and nested queries emerged to facilitate the retrieval and management of data stored in multiple, often interrelated tables within a relational database. As databases are normalized to reduce redundancy, the meaningful information extracted often requires combining data from dif
3 min read
Tuple Relational Calculus (TRC) in DBMSTuple Relational Calculus (TRC) is a non-procedural query language used to retrieve data from relational databases by describing the properties of the required data (not how to fetch it). It is based on first-order predicate logic and uses tuple variables to represent rows of tables.Syntax: The basi
4 min read
Domain Relational Calculus in DBMSDomain Relational Calculus (DRC) is a formal query language for relational databases. It describes queries by specifying a set of conditions or formulas that the data must satisfy. These conditions are written using domain variables and predicates, and it returns a relation that satisfies the specif
4 min read
Functional Dependencies & Normalization
Attribute Closure in DBMSFunctional dependency and attribute closure are essential for maintaining data integrity and building effective, organized and normalized databases. Attribute closure of an attribute set can be defined as set of attributes which can be functionally determined from it.How to find attribute closure of
4 min read
Armstrong's Axioms in Functional Dependency in DBMSArmstrong's Axioms refer to a set of inference rules, introduced by William W. Armstrong, that are used to test the logical implication of functional dependencies. Given a set of functional dependencies F, the closure of F (denoted as F+) is the set of all functional dependencies logically implied b
4 min read
Canonical Cover of Functional Dependencies in DBMSManaging a large set of functional dependencies can result in unnecessary computational overhead. This is where the canonical cover becomes useful. A canonical cover is a set of functional dependencies that is equivalent to a given set of functional dependencies but is minimal in terms of the number
7 min read
Normal Forms in DBMSIn the world of database management, Normal Forms are important for ensuring that data is structured logically, reducing redundancy, and maintaining data integrity. When working with databases, especially relational databases, it is critical to follow normalization techniques that help to eliminate
7 min read
The Problem of Redundancy in DatabaseRedundancy means having multiple copies of the same data in the database. This problem arises when a database is not normalized. Suppose a table of student details attributes is: student ID, student name, college name, college rank, and course opted. Student_ID Name Contact College Course Rank 100Hi
6 min read
Lossless Join and Dependency Preserving DecompositionDecomposition of a relation is done when a relation in a relational model is not in appropriate normal form. Relation R is decomposed into two or more relations if decomposition is lossless join as well as dependency preserving. Lossless Join DecompositionIf we decompose a relation R into relations
4 min read
Denormalization in DatabasesDenormalization is a database optimization technique in which we add redundant data to one or more tables. This can help us avoid costly joins in a relational database. Note that denormalization does not mean 'reversing normalization' or 'not to normalize'. It is an optimization technique that is ap
4 min read
Transactions & Concurrency Control
ACID Properties in DBMSIn the world of DBMS, transactions are fundamental operations that allow us to modify and retrieve data. However, to ensure the integrity of a database, it is important that these transactions are executed in a way that maintains consistency, correctness, and reliability. This is where the ACID prop
6 min read
Types of Schedules in DBMSScheduling is the process of determining the order in which transactions are executed. When multiple transactions run concurrently, scheduling ensures that operations are executed in a way that prevents conflicts or overlaps between them.There are several types of schedules, all of them are depicted
6 min read
Recoverability in DBMSRecoverability is a critical feature of database systems. It ensures that after a failure, the database returns to a consistent state by permanently saving committed transactions and rolling back uncommitted ones. It relies on transaction logs to undo or redo changes as needed. This is crucial in mu
6 min read
Implementation of Locking in DBMSLocking protocols are used in database management systems as a means of concurrency control. Multiple transactions may request a lock on a data item simultaneously. Hence, we require a mechanism to manage the locking requests made by transactions. Such a mechanism is called a Lock Manager. It relies
5 min read
Deadlock in DBMSA deadlock occurs in a multi-user database environment when two or more transactions block each other indefinitely by each holding a resource the other needs. This results in a cycle of dependencies (circular wait) where no transaction can proceed.For Example: Consider the image belowDeadlock in DBM
4 min read
Starvation in DBMSStarvation in DBMS is a problem that happens when some processes are unable to get the resources they need because other processes keep getting priority. This can happen in situations like locking or scheduling, where some processes keep getting the resources first, leaving others waiting indefinite
8 min read
Advanced DBMS
Indexing in DatabasesIndexing in DBMS is used to speed up data retrieval by minimizing disk scans. Instead of searching through all rows, the DBMS uses index structures to quickly locate data using key values.When an index is created, it stores sorted key values and pointers to actual data rows. This reduces the number
6 min read
Introduction of B TreeA B-Tree is a specialized m-way tree designed to optimize data access, especially on disk-based storage systems. In a B-Tree of order m, each node can have up to m children and m-1 keys, allowing it to efficiently manage large datasets.The value of m is decided based on disk block and key sizes.One
8 min read
Introduction of B+ TreeA B+ Tree is an advanced data structure used in database systems and file systems to maintain sorted data for fast retrieval, especially from disk. It is an extended version of the B Tree, where all actual data is stored only in the leaf nodes, while internal nodes contain only keys for navigation.C
5 min read
Bitmap Indexing in DBMSBitmap Indexing is a powerful data indexing technique used in Database Management Systems (DBMS) to speed up queries- especially those involving large datasets and columns with only a few unique values (called low-cardinality columns).In a database table, some columns only contain a few different va
3 min read
Inverted IndexAn Inverted Index is a data structure used in information retrieval systems to efficiently retrieve documents or web pages containing a specific term or set of terms. In an inverted index, the index is organized by terms (words), and each term points to a list of documents or web pages that contain
7 min read
SQL Queries on Clustered and Non-Clustered IndexesIndexes in SQL play a pivotal role in enhancing database performance by enabling efficient data retrieval without scanning the entire table. The two primary types of indexes Clustered Index and Non-Clustered Index serve distinct purposes in optimizing query performance. In this article, we will expl
7 min read
File Organization in DBMSA database consists of a huge amount of data. The data is grouped within a table in RDBMS, and each table has related records. A user can see that the data is stored in the form of tables, but in actuality, this huge amount of data is stored in physical memory in the form of files. A file is named a
5 min read
DBMS Practice