Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 22

Session 2

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Agenda:

 Database Architecture
 Data Independence
 Languages
 Tools and Interfaces in DBMS
 DBMS Types

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
DATABASE ARCHITECTURE
 In Architecture of database, there are three levels:
External Level
Conceptual Level
Internal Level

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
External Level or View level
It is the users’ view of the database.

This level describes that part of the database that is relevant to each user.

 For example, one user may view dates in the form (day, month, year), while

another may view dates as (year, month, day).

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Conceptual Level or Logical level
 It is the community view of the database.

 This level describes what data is stored in the database and the relationships among the data.

 It represents:

 All entities, their attributes and their relationships.

 The constraints on the data.

 Security and integrity information.

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Internal Level or Storage level
 It is the physical representation of the database on the computer.

 This level describes how the data is stored in the database.

 The internal level is concerned with:

 Storage space allocation for data and indexes.

 Record descriptions for storage.

 Record placement.

 Data compression and data encryption techniques.

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Schema:
 The overall description of the database is called the Database Schema.
 A schema is defined as an outline or a plan that describes the records and

relationships existing at the particular level.


 Database Schema:

◦ The description of a database.

◦ Includes descriptions of the database structure, data types, and the constraints on

the database.
 Schema Diagram:

◦ An illustrative display of (most aspects of) a database schema.

 Schema Construct:

◦ A component of the schema or an object within the schema, e.g., STUDENT,

COURSE.

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Schemas versus Instances
• Database State:
• The actual data stored in a database at a particular moment in
time.
• This includes the collection of all the data in the database.
• Also called database instance (or occurrence or snapshot).
• The term instance is also applied to individual database components, e.g.
record instance, table instance, entity instance

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Example

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Mapping between Views
 External/Conceptual Mapping: A mapping between the external and conceptual views

gives the correspondence among the records and the relationships of the external and

conceptual views.

 Conceptual/Internal Mapping: Conceptual schema is related to the internal schema by

the conceptual/internal mapping. This enables the DBMS to find the actual record or

combination of records in physical storage that constitute a logical record in conceptual

schema.

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Data Independence

 There are two types of data independence:

 Logical data independence

 Physical data independence

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Data Independence
When a schema at a lower level is changed, only the
mappings between this schema and higher level schemas
need to be changed in a DBMS that fully supports data
independence.

The higher-level schemas themselves are unchanged.


◦ Hence, the application programs need not be changed since
they refer to the external schemas
Logical & Physical data independence

 Logical Data Independence:


◦ The capacity to change the conceptual schema without having

to change the external schemas and their associated application


programs.
 Physical Data Independence:

◦ The capacity to change the internal schema without having to

change the conceptual schema.


◦ For example, the internal schema may be changed when

certain file structures are reorganized or new indexes are


created to improve database performance

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
DBMS Languages

• Data Definition Language (DDL)


• Data Manipulation Language (DML)
• High-Level or Non-procedural Languages: These include the
relational language SQL
• Low Level or Procedural Languages:

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Tools:
• Data dictionary / repository:
• Used to store schema descriptions and other information such as
design decisions, application program descriptions, user
information, usage standards, etc.
• Active data dictionary is accessed by DBMS software and
users/DBA.
• Passive data dictionary is accessed by users/DBA only.
• Application Development Environments and CASE
(computer-aided software engineering) tools:
• Examples – Power builder (Sybase), Builder (Borland)
© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
DBMS Interfaces
 Stand-alone query language interfaces

◦ Example: Entering SQL queries at the DBMS interactive SQL interface (e.g. SQL*Plus in ORACLE)

 Programmer interfaces for embedding DML in programming languages

◦ Embedded Approach:e.g embedded SQL (for C, C++, etc.), SQLJ (for Java)

◦ Procedure Call Approach: e.g. JDBC for Java, ODBC for other programming languages

◦ Database Programming Language Approach: e.g. ORACLE has PL/SQL, a programming language

based on SQL; language incorporates SQL and its data types as integral components

 User-friendly interfaces

◦ Menu-based, forms-based, graphics-based, etc.

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Types of DBMS:

• Object Based Databases


• Hierarchical Databases
• Network Databases
• Relational Databases

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Object Databases and Hierarchical Databases

• Object based databases use concepts such as entities, attributes, and


relationships.

• Hierarchical Databases: Hierarchical Database model is one of the


oldest database models. Information Management System (IMS) is
based on this model

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Example:

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Network Databases:
• The Network Databases represents data with a graph. The main
difference of the network model from the hierarchical model, is its
ability to handle many to many (N:N) relations

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED
Relational Databases:
• Relational Databases stores data in the form of tables. This concept
purposed by Dr. E.F. Codd, a researcher of IBM in the year 1960 s

© 2017-18 KL University – The contents of this presentation are an intellectual and copyrighted property of KL University. ALL RIGHTS RESERVED

You might also like