DBS Lab Manual
DBS Lab Manual
A
Laboratory Manual
Semester: IV
DATABASE MANAGEMENT SYSTEM(DBS198917)
Department Vision
Create a sustainable academic environment to produce highly competent
computer professionals of the future
Department Mission
• To expose students to latest tools and technologies in computing
• To foster the professional development of students by providing
excellence in education.
• To adapt rapid advancements in computing by engaging students in the
lifelong learning.
• To inculcate sound ethical, moral and social values amongst students
for benefit of the society.
Program Educational objectives
PEO1-Identify frame and solve computing problems by applying knowledge in Computer
engineering
PEO2- Promote lifelong learning by integrating academic knowledge and practical applications
PEO3- Depict effective team work and practical skills for holistic development
Program Outcomes
1. Basic and Discipline specific knowledge: Apply knowledge of basic mathematics,
science and engineering fundamentals and engineering specialization to solve the
engineering problems
2. Problem analysis: Identify and analyse well-defined engineering problems using codified
standard methods
3. Design/ development of solutions: Design solutions for well-defined technical problems
and assist with the design of systems components or processes to meet specified needs
Computer Engineering Department, S. B. M. Polytechnic, Mumbai
2|Page
DATABASE MANAGEMENT SYSTEM(DBS198917)
4. Engineering Tools, Experimentation and Testing: Apply modern engineering tools and
appropriate technique to conduct standard tests and measurements
5. Engineering practices for society, sustainability and environment: Apply appropriate
technology in context of society, sustainability, environment and ethical practices.
6. Project Management: Use engineering management principles individually, as a team
member or a leader to manage projects and effectively communicate about well-defined
engineering activities
7. Life-long learning: Ability to analyse individual needs and engage in updating in the
context of technological changes
Course Outcomes
CO-PO Mapping
INDEX
Sr.
No. Page
Name of Experiment POs Covered
No.
Theory:
Database Management System
This model is like a hierarchical tree structure, used to construct a hierarchy of records in
the form of nodes and branches. The data elements present in the structure have Parent-Child
relationship. Closely related information in the parent-child structure is stored together as a
logical unit. A parent unit may have many child units, but a child is restricted to have only one
parent.
The drawbacks of this model are:
The hierarchical structure is not flexible to represent all the relationship proportions, which
occur in the real world.
It cannot demonstrate the overall data model for the enterprise because of the non-availability
of actual data at the time of designing the data model. It cannot represent the Many-to-Many
relationship.
Network Model
It supports the One-To-One and One-To-Many types only. The basic objects in
this model are Data Items, Data Aggregates, Records and Sets.
Relational Model
Does not maintain physical connection between relations Data is organized in terms of rows
and columns in a table The position of a row and/or column in a table is of no importance The
intersection of a row and column must give a single value .
Features of an RDBMS
The ability to create multiple relations and enter data into them An attractive query language
Retrieval of information stored in more than one table
An RDBMS product has to satisfy at least seven of the 12 rules of Codd to be
accepted as a full- fledged RDBMS.
RDBMS is acronym for Relation Database Management System. Dr. E. F. Codd first introduced
the Relational Database Model in 1970. The Relational model allows data to be represented in a
simple row- column. Each data field is considered as a column and each record is considered as
a row. Relational Database is more or less similar to Database Management System. In
relational model there is relation between their data elements. Data is stored in tables. Tables
have columns, rows and names. Tables can be related to each other if each has a column with a
common type of information.
The most famous RDBMS packages are Oracle, Sybase and Informix.
1 Rahul Satelite
2 Sachin Ambawadi
3 Saurav Naranpura
Student Marksheet Table
Rollno Sub1 Sub2 Sub3
1 78 89 94
2 54 65 77
3 23 78 46
Here, both tables are based on students details. Common field in both tables is Rollno. So we can say
both tables are related with each other through Rollno column.
Degree of Relationship
The Degree of Relationship indicates the link between two entities for a specified occurrence of
each.
One student has only one Rollno. For one occurrence of the first entity, there can be, at the most
one related occurrence of the second entity, and vice-versa.
1M
As per the Institutions Norm, One student can enroll in one course at a time however, in one
course, there can be more than one student.
For one occurrence of the first entity there can exist many related occurrences of the second entity
and for every occurrence of the second entity there exists only one associated occurrence of the first.
MM
The major disadvantage of the relational model is that a clear-cut interface cannot be determined.
Reusability of a structure is not possible. The Relational Database now accepted model on which
major database system are built.
Oracle has introduced added functionality to this by incorporated object-oriented capabilities. Now it
is known is as Object Relational Database Management System (ORDBMS). Object-
oriented concept is added in Oracle8.
Some basic rules have to be followed for a DBMS to be relational. They are known as Codd’s rules,
designed in such a way that when the database is ready for use it encapsulates the relational theory to its
full potential. The shapes of ER Diagram are as follows:
Procedure:
Aim:
Creating of table with constraint and insertion of data.
Theory:
SQL (Structured Query Language):
Structured Query Language is a database computer language designed for managing
data in relational database management systems (RDBMS), and originally based upon
Relational Algebra. Its scope includes data query and update, schema creation and
modification, and data access control.
SQL was one of the first languages for Edgar F. Codd's relational model and became
the most widely used language for relational databases.
• IBM developed SQL in mid of 1970’s.
• Oracle incorporated in the year 1979.
• SQL used by IBM/DB2 and DS Database Systems. SQL adopted as standard
language for RDBS by ASNI in 1989.
DATA TYPES:
1. CHAR (Size): This data type is used to store character strings values of fixed length.
The size in brackets determines the number of characters the cell can hold. The maximum
number of character is 255 characters.
2. VARCHAR (Size) / VARCHAR2 (Size): This data type is used to store variable length
alphanumeric data. The maximum character can hold is 2000 character.
3. NUMBER (P, S): The NUMBER data type is used to store number (fixed or floating
point). Number of virtually any magnitude may be stored up to 38 digits of precision.
Number as large as 9.99 * 10 124. The precision (p) determines the number of places to the
right of the decimal. If scale is omitted then the default is zero. If precision is omitted, values
are stored with their original precision up to the maximum of 38 digits.
4. DATE: This data type is used to represent date and time. The standard format is DD-
MM-YY as in 17-SEP-2009. To enter dates other than the standard format, use the
appropriate functions. Date time stores date in the 24-Hours format. By default the time
in a date field is 12:00:00 am, if no time portion is specified. The default date for a date field
is the first day the current month.
5. LONG: This data type is used to store variable length character strings containing up to
2GB. Long data can be used to store arrays of binary data in ASCII format. LONG values
cannot be indexed, and the normal character functions such as SUBSTR cannot be applied.
6. RAW: The RAW data type is used to store binary data, such as digitized picture or
image. Data loaded into columns of these data types are stored without any further
conversion. RAW data type can have a maximum length of 255 bytes. LONG RAW data
type can contain up to 2GB.
SQL language is sub-divided into several language elements, including:
▪ Clauses, which are in some cases optional, constituent components of statements and
queries.
▪ Expressions, which can produce either scalar values or tables consisting of columns and
rows of data.
▪ Predicates which specify conditions that can be evaluated to SQL three-valued logic
(3VL) Boolean truth values and which are used to limit the effects of statements and queries,
▪ Statements which may have a persistent effect on schemas and data, or which may
▪ SQL statements also include the semicolon (";") statement terminator. Though not
▪ Insignificant white space is generally ignored in SQL statements and queries, making it
1. CREATE:
(a)CREATE TABLE: This is used to create a new relation (table)
CONSTRAINTS:
Constraints are used to specify rules for the data in a table. If there is any violation between
the constraint and the data action, the action is aborted by the constraint. It can be specified
when the table is created (using CREATE TABLE statement) or after the table is created
(using ALTER TABLE statement).
1. NOT NULL: When a column is defined as NOTNULL, then that column becomes a
mandatory column. It implies that a value must be entered into the column if the record is to
be accepted for storage in the table.
Syntax:
CREATE TABLE Table_Name (column_name data_type (size) NOT NULL, );
Example:
CREATE TABLE student (sno NUMBER(3)NOT NULL, name CHAR(10));
2. UNIQUE: The purpose of a unique key is to ensure that information in the column(s) is
unique i.e. a value entered in column(s) defined in the unique constraint must not be repeated
across the column(s). A table may have many unique keys.
Syntax:
CREATE TABLE Table_Name(column_name data_type(size) UNIQUE, ….);
Example:
CREATE TABLE student (sno NUMBER(3) UNIQUE, name CHAR(10));
3. CHECK: Specifies a condition that each row in the table must satisfy. To satisfy the
constraint, each row in the table must make the condition either TRUE or unknown (due to a
null).
Syntax:
CREATE TABLE Table_Name(column_name data_type(size) CHECK(logical
expression), ….); Example:
CREATE TABLE student (sno NUMBER (3), name CHAR(10),class
CHAR(5),CHECK(class IN(‘CSE’,’CAD’,’VLSI’));
5. FOREIGN KEY: It is a table level constraint. We cannot add this at column level. To
reference any primary key column from other table this constraint can be used. The table in
which the foreign key is defined is called a detail table. The table that defines the primary key
and is referenced by the foreign key is called the master table.
Syntax: CREATE TABLE Table_Name(column_name data_type(size)
FOREIGN KEY(column_name) REFERENCES table_name);
Example:
CREATE TABLE subject (scode NUMBER (3) PRIMARY KEY, subname
CHAR(10),fcode NUMBER(3), FOREIGN KEY(fcode) REFERENCE faculty );
(or)
3. DELETE-FROM: This is used to delete all the records of a relation but it will
retain the structure of that relation.
a) DELETE-FROM: This is used to delete all the records of relation.
Syntax: SQL>DELETE FROM relation_name;
Example: SQL>DELETE FROM std;
b) DELETE -FROM-WHERE: This is used to delete a selected record from a
relation. Syntax: SQL>DELETE FROM relation_name WHERE condition;
Example: SQL>DELETE FROM student WHERE sno = 2;
2. TRUNCATE: This command will remove the data permanently. But structure
will not be removed.
10 ACCOUNTING
20 RESEARCH
30 SALES
3. SELECT - FROM -WHERE: This query is used to display a selected set of
fields for a selected set of records of a relation.
Syntax: ALTER TABLE relation_name ADD (new field_1 data_type(size), new field_2
data_type(size),..);
Example: SQL>ALTER TABLE std ADD (Address CHAR(10));
(b) ALTER TABLE...MODIFY...: This is used to change the width as well as data type of
fields of existing relations.
c) ALTER TABLE..DROP .... This is used to remove any field of existing relations.
3. DROP TABLE: This is used to delete the structure of a relation. It permanently deletes
the records in the table.
Syntax: DROP TABLE relation_name; Example:
SQL>DROP TABLE std;
4. DELETE-FROM: This is used to delete all the records of a relation but it will retain
the structure of that relation.
c) DELETE-FROM: This is used to delete all the records of relation.
Syntax: SQL>DELETE FROM relation_name;
Example: SQL>DELETE FROM std;
d) DELETE -FROM-WHERE: This is used to delete a selected record from a relation.
Syntax: SQL>DELETE FROM relation_name WHERE condition;
Example: SQL>DELETE FROM student WHERE sno = 2;
1. Count: COUNT following by a column name returns the count of tuple in that column.
If DISTINCT keyword is used then it will return only the count of unique tuple in the column.
Otherwise, it will return count of all the tuples (including duplicates) count (*) indicates all
the tuples of the column.
Syntax: COUNT (Column name)
Example: SELECT COUNT (Sal) FROM emp;
2. SUM: SUM followed by a column name returns the sum of all the values in that
column.
Syntax: SUM (Column name)
Example: SELECT SUM (Sal) From emp;
3. AVG: AVG followed by a column name returns the average value of that column
values.
Syntax: AVG (n1, n2...)
Example: Select AVG (10, 15, 30) FROM DUAL;
4. MAX: MAX followed by a column name returns the maximum value of that column.
Syntax: MAX (Column name)
Example: SELECT MAX (Sal) FROM emp;
SQL> select deptno, max(sal) from emp group by deptno;
10 5000
20 3000
30 2850
DATABASE MANAGEMENT SYSTEM(DBS198917)
SQL> select deptno, max (sal) from emp group by deptno having max(sal)<3000;
DEPTNO MAX(SAL)
30 2850
5. MIN: MIN followed by column name returns the minimum value of that column.
Syntax: MIN (Column name)
Example: SELECT MIN (Sal) FROM emp;
10 1300
CHARACTER FUNCTION:
3. List the employees in the ascending order of Designations of those joined after 1981.
4. List the employees along with their Experience and Daily Salary.
9. Dislay the name as well as the first five characters of name(s) starting with ‘H’
10. List all the emps except ‘PRESIDENT’ & ‘MGR” in asc order of Salaries.
Objective:
To learn the concept of group functions
Theory:
• GROUP BY: This query is used to group to all the records in a relation
together for each and every value of a specific key(s) and then display
them for a selected set of fields the relation.
Example: SQL> SELECT EMPNO, SUM (SALARY) FROM EMP GROUP BY EMPNO;
GROUP BY-HAVING : The HAVING clause was added to SQL because the
WHERE keyword could not be used with aggregate functions. The HAVING clause
must follow the GROUP BY clause in a query and must also precede the ORDER BY
clause if used.
JOIN using GROUP BY: This query is used to display a set of fields from two
relations by matching a common field in them and also group the corresponding
records for each and every value of a specified key(s) while displaying.
DATABASE MANAGEMENT SYSTEM(DBS198917)
• ORDER BY: This query is used to display a selected set of fields from a
relation in an ordered manner base on some field.
Example: SQL> SELECT empno, ename, job FROM emp ORDER BY job;
JOIN using ORDER BY: This query is used to display a set of fields from two
relations by matching a common field in them in an ordered manner based on some
fields. Syntax: SELECT <set of fields (from both relations)> FROM relation_1,
relation_2
WHERE relation_1.field_x = relation_2.field_y ORDER BY field_z;
Example: SQL> SELECT empno,ename,job,dname FROM emp,dept
WHERE emp.deptno = 20 ORDER BY job;
• INDEXING: An index is an ordered set of pointers to the data in a table. It
is based on the data values in one or more columns of the table. SQL Base
stores indexes separately from tables.
An index provides two benefits:
• It improves performance because it makes data access faster.
• It ensures uniqueness. A table with a unique index cannot have two rows
with the same values in the column or columns that form the index key.
Syntax:
CREATE INDEX <index_name> on <table_name> (attrib1,attrib 2….attrib
n);
Example:
CREATE INDEX id1 on emp(empno,dept_no);
Aim:
Execution of string, comparison and set operations.
Theory:
STRING FUNCTIONS:
Concat: CONCAT returns char1 concatenated with char2. Both char1 and char2 can
be any of the datatypes
Lpad: LPAD returns expr1, left-padded to length n characters with the sequence of
characters in expr2.
SQL>SELECT LPAD(‘ORACLE’,15,’*’)FROM DUAL;
*********ORACLE
Rpad: RPAD returns expr1, right-padded to length n characters with expr2,
replicated as many times as necessary.
SQL>SELECT RPAD (‘ORACLE’,15,’*’)FROM DUAL;
ORACLE*********
DBMS
Length: Returns the number of characters, rather than the number of bytes, of the
given string expression, excluding trailing blanks.
SQL>SELECT LENGTH(‘DATABASE’)FROM DUAL;
8
Substr: Returns part of a character, binary, text, or image expression.
SQL>SELECT SUBSTR(‘ABCDEFGHIJ’3,4)FROM DUAL;
CDEF
Instr: The INSTR functions search string for substring. The function returns an
integer indicating the position of the character in string that is the first character of this
occurrence.
SQL>SELECT INSTR('CORPORATE FLOOR','OR',3,2)FROM DUAL;
14
COMPARISION OPERATORS:
(=): Checks if the values of two operands are equal or not, if yes then condition
becomes true.
(!=): Checks if the values of two operands are equal or not, if values are not equal then
condition becomes true.
(< >): Checks if the values of two operands are equal or not, if values are not equal
then condition becomes true.
(>): Checks if the value of left operand is greater than the value of right operand, if
yes then condition becomes true
(<): Checks if the value of left operand is less than the value of right operand, if yes
then condition becomes true.
(>=): Checks if the value of left operand is greater than or equal to the value of right
operand, if yes then condition becomes true.
(<=): Checks if the value of left operand is less than or equal to the value of right
operand, if yes then condition becomes true.
Computer Engineering Department, S. B. M. Polytechnic, Mumbai
30 | P a g e
DATABASE MANAGEMENT SYSTEM(DBS198917)
SET OPERATORS:
The Set operator combines the result of 2 queries into a single result. The
following are the operators:
• Union
• Union all
• Intersect
• Minus
Theory :
The SQL Joins clause is used to combine records from two or more tables in a
database. A JOIN is a means for combining fields from two tables by using values common to
each.The join is actually performed by the ‘where’ clause which combines specified rows of
tables.
Syntax:
SELECT column 1, column 2, column 3...
FROM table_name1, table_name2
WHERE table_name1.column name = table_name2.columnname;
Types of Joins :
1. Simple Join
2. Self Join
3. Outer Join
Simple Join:
It is the most common type of join. It retrieves the rows from 2 tables having a
common column and is further classified into
Equi-join :
A join, which is based on equalities, is called equi-join.
Example:
Select * from item, cust where item.id=cust.id;
In the above statement, item-id = cust-id performs the join statement. It retrieves rows from
both the tables provided they both have the same id as specified by the where clause. Since
the where clause uses the comparison operator (=) to perform a join, it is said to be
equijoin. It combines the matched rows of tables. It can be used as follows:
Non Equi-join:
It specifies the relationship between columns belonging to different tables by
making use of relational operators other than’=’.
Example:
Select * from item, cust where item.id<cust.id;
DATABASE MANAGEMENT SYSTEM(DBS198917)
Table Aliases
Table aliases are used to make multiple table queries shorted and more readable. We give
an alias name to the table in the ‘from’ clause and use it instead of the name throughout the
query.
Self join:
Joining of a table to itself is known as self-join. It joins one row in a table to another.
It can compare each row of the table to itself and also with other rows of the same table.
Example:
select * from emp x ,emp y where x.salary >= (select avg(salary) from x.emp
where x. deptno =y.deptno);
Outer Join:
It extends the result of a simple join. An outer join returns all the rows returned by simple join
as well as those rows from one table that do not match any row from the table. The symbol(+)
represents outer join.
Theory:
VIEW: In SQL, a view is a virtual table based on the result-set of an SQL statement.
A view contains rows and columns, just like a real table. The fields in a view
are fields from one or more real tables in the database.
You can add SQL functions, WHERE, and JOIN statements to a view and present the
data as if the data were coming from one single table.
A view is a virtual table, which consists of a set of columns from one or more tables.
It is similar to a table but it does not store in the database. View is a query stored as an
object.
Example:
DROPPING A VIEW: A view can deleted with the DROP VIEW command.
1. Find all information of sailors who have reserved boat number 101.
2. Find the name of boat reserved by Bob.
3. Find the names of sailors who have reserved a red boat, and list in the order of
age.
4. Find the names of sailors who have reserved at least one boat.
5. Find the ids and names of sailors who have reserved two different boats on the
same day.
6. Find the ids of sailors who have reserved a red boat or a green boat.
7. Find the name and the age of the youngest sailor.
8. Count the number of different sailor names.
9. Find the average age of sailors for each rating level.
10. Find the average age of sailors for each rating level that has at least two
sailors.
Conclusion: To be written by the students.
Types
1. Sub queries that return several values
Sub queries can also return more than one value. Such results should be made
use along with the operators in and any.
2. Multiple queries
Here more than one sub query is used. These multiple sub queries are combined
by means of ‘and’ & ‘or’ keywords.
3. Correlated sub query
A sub query is evaluated once for the entire parent statement whereas a
correlated Sub query is evaluated once per row processed by the parent
statement.
Theory:
Database normalization is a technique for designing relational database tables to
minimize duplication of information and, in so doing, to safeguard the database against
certain types oflogical or structural problems, namely data anomalies.
For example, when multiple instances of a given piece of information occur in a table,
the possibility exists that these instances will not be kept consistent when the data
within the table is updated, leading to a loss of data integrity.
A table that is sufficiently normalized is less vulnerable to problems of this kind, because its structure
reflects the basic assumptions for when multiple instances of the same information should be
Normalization is a process of converting a relation to be standard form by
decomposition a larger relation into smaller efficient relation that depicts a good
database design.
• 1NF: A Relation scheme is said to be in 1NF if the attribute values in the relation
are atomic.i.e., Mutli –valued attributes are not permitted.
• 2NF: A Relation scheme is said to be in 2NF,iff and every Non-key attribute is fully
functionally dependent on primary Key.
• 3NF: A Relation scheme is said to be in 3NF,iff and does not have transitivity
dependencies. A Relation is said to be 3NF if every determinant is a key for each & every
functional dependency.
• BCNF: A Relation scheme is said to be BCNF if the following statements are true
for eg FD P->Q in set F of FDs that holds for each FD. P->Q in set F of FD’s that holds
over R. Here P is the subset of attributes of R & Q is a single attribute of R represented by
a single instance only.
Normalized tables are:- mysql> create table Bus(BusNo varchar(20) primary
key,Source varchar(20),Destination varchar(20));