Scribd
Upload
8 views

Database

Uploaded by

vivekrader
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Database

Uploaded by

vivekrader
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

KNIMT, Faculty of Pharmacy Notes: Computer Application in Pharmacy(BP205T)

Faridipur, Sultanpur
Database Management System

A Database Management System (DBMS) is a software application that provide a set of


programs to organize, create, delete, update, and manipulate data in a database. There are mainly
four methods to organize data in a database.
1. Hierarchical
2. Network
3. Relational

In a Hierarchical Database, the data elements are linked in the form of an inverted tree structure
with the root at the top, and the branches formed below. There is a parent-child relationship among
the data elements of a hierarchical database. A parent data element is the one that has one or more
subordinate data elements. The data elements that are below a parent data elements are its children
data elements.
For example, let us take the example of a hierarchical database of an organization’s employees.
Employees are categorized by the department in which they work, and within a department, they
are categorized by their job function, such as manager, engineers, technicians, and support staff.

Faculty Name: Vivek Srivastava Page 1 of 4


KNIMT, Faculty of Pharmacy Notes: Computer Application in Pharmacy(BP205T)
Faridipur, Sultanpur

A NETWORK DATABASE structure is an extension of the hierarchical database structure. In this


model also, the data elements of a database are organized in the form of parent-child relationships,
and all the types of relationships among the data elements must be determined when the database
is first designed.
In a network database, however, a child data element can have more than one parent element or
no parent at all. This database permit the extraction of needed information by beginning from any
data element in the database structure, instead of starting from the root data element.
For example, network database which maintains the relationships among the courses offered and
the students enrolled for each course in a college. As can be seen from the example, the parent and
child elements can have many-to-many relationships in a network database structure. That is, each
student may be enrolled for several courses, and each course may have a number of students
enrolled for it.
With this database structure, it is possible to easily produce both a course-wise students report (a
report showing all students enrolled for each course) and a student-wise courses report (a report
showing all courses taken by each student).

Faculty Name: Vivek Srivastava Page 2 of 4


KNIMT, Faculty of Pharmacy Notes: Computer Application in Pharmacy(BP205T)
Faridipur, Sultanpur

In a RELATIONAL DATABASE, the data elements are organized in the form of multiple tables
with rows and columns. Each table of the database is stored as a separate file. Each table column
represent a data field, and each row a data record (all know as tuple).
The data in one table is related to data in another table with a common field.
For example, a sample library database is comprised of three tables. The first table contains the
data of library members, the second table contains the data of borrowed books, and the third
table contains the data of books in the library.
Each new member is assigned a membership number and issued a library card with this number
on it. The member’s name, address, and membership number are added in member data table.
When a member borrows a book, the membership number of the borrower, the book’s ISBN
number (which serves as a unique identification number for a book), and the due date for returning
the book are added to the second table. The first and second tables are related by the ‘Membership
No.’ common field, and the second and third tables are related by the “Book No.” common field.
Now let us assume that the librarian wants a report of overdue books as of 10-11-2001, and wants
the list to contain the borrower’s details and the book’s details for each overdue book. To
produce such a report, the database search routine will first search for the due date field in the
borrowed book data table to surface the three overdue books. The database management system
will then use the ‘Membership No’ filed to cross-reference the book’s details of each overdue book
from the member’s data table, and the ‘Book No.’ field to cross-reference the book’s details of

Faculty Name: Vivek Srivastava Page 3 of 4


KNIMT, Faculty of Pharmacy Notes: Computer Application in Pharmacy(BP205T)
Faridipur, Sultanpur
each overdue book from the book data table. The final report thus produced, would look something
like the one shown in figure.

Faculty Name: Vivek Srivastava Page 4 of 4

You might also like