DATABASE LEC

-COLLECTION OF RELATED
DATA

- KNOWN FACTS THAT CAN

BE RECORDED AND THAT
HAVE IMPLICIT MEANING.

- DATABASE REPRESENTS
SOME ASPECT OF THE REAL
WORLD.

- LOGICALLY COHERENT
COLLECTION OF DATA WITH
SOME INHERENT MEANING

-MAY PERFORM BUSINESS TRANSACTION OR

EVENTS MAY HAPPEN THAT CAUSE THE
INFORMATION IN THE DATABASE CHANGE.

- MAINTAINED DATABASE OF EVEN GREATER

SIZE AND COMPLEXITY TO MONITOR TAX
FORMS.

- IT CONTAINS 20M BOOKS

CDS VIDEOS GAMES AND
OTHER ITEMS.

- IS A COLLECTION OF PROGRAMS THAT ENABLES USERS TO CREATE AND

MAINTAIN A DATABASE.
IS A GENERAL PURPOSE SOFTWARE SYSTEM THAT FACILITIES THE PROCESS
OF DEFINING CONSTRUCTING MANIPULATING AND SHARING DATABASE

GENERAL PURPOSES OF
DBMS

-INVOLVES SPECIFYING DATA

TYPES STRUCTURES AND
CONSTRAINTS.

- THE DATABASE DEFINITION OR DESCRIPTIVE

INFORMATION IS ALSO STORED BY THE DBMS
IN A FORM OF CATALOG OR DICTIONARY.

- PROCESS OF STORING THE DATA ON SOM

STORAGE MEDIUM THAT IS CONTROLLED BY
DBMS.

-INCLUDES FUNCTIONS SUCH AS QUERYING THE

DATABASE TO RETRIEVE SPECIFIC DATA UPDATING THE
DATABASE TO REFLECT CHANGES IN MINIWORLD AND
GENERATING REPORTS FROM THE DATA.

- ALLOWS MULTIPLE USERS AND PROGRAMS

TO ACCESS THE DATABASE
SIMULTANEOUSLY.

- ACCESSES THE DATABASE BY SENDING

QUERIES OR REQUESTS FOR DATA TO THE
DBMS.

-TYPICALLY CAUSES SOME

DATA TO BE RETRIEVED

-MAY CAUSE SOME DATA TO BE READ AND

SOME DATA TO BE WRITTEN INTO THE
DATABASE.

- MAY CAUSE SOME DATA TO BE READ AND

SOME DATA TO BE WRITTEN INTO THE
DATABASE.

FUNCTIONS OF DBMS

-REPRESENTED AND
MANIPULATED USING
COMPUTERIZED TOOLS.

- EXPRESSED IN A DATA
MODEL IMPLEMENTED IN A
COMMERCIAL DBMS.

- FINAL STAGE FOR STORING

AND ACCESSING THE
DATABASE.

-EACH USER DEFINES AND IMPLEMENTS THE FILES

NEEDED FOR A SPECIFIC SOFTWARE APPLICATION AS
PART OF PROGRAMMING THE APPLICATION.

-STORED IN DBMS CATALOG

CONTAINS INFORMATION.

-INFORMATION STORED IN
THE CATALOG.

- USED BY THE DBMS SOFTWARE AND ALSO BY

DATABASE USERS WHO NEED INFORMATION
ABOUT THE DATABASE STRUCTURE.

- THE STRUCTURE OF DATA FILES IS STORED

IN THE DBMS CATALOG SEPARATELY FROM
THE ACCESS PROGRAM.

-ALSO CALLED FUNCTION

OR METHOD.

TWO PARTS OF OPERATION

- INCLUDES IN THE OPERATION NAME AND

THE DATA TYPES OF ITS ARGUMENTS
(PARAMETERS)

- SPECIFIED SEPARATELY AND CAN BE

CHANGED WITHOUT AFFECTING THE
INTERFACE.

-USER APPLICATION PROGRAMS CAN

OPERATE ON THE DATA BY INVOKING
NAMES AND ARGUMENTS.

- CHARACTERISTICS THAT ALLOWS

PROGRAM DATA INDEPENDENCE AND
PROGRAM OPERATION INDEPENDENCE.

- TYPE OF DATA ABSTRACTION THAT IS USED

TO PROVIDE THIS CONCEPTUAL
REPRESENTATION.

- SUBSET OF THE DATABASE

AND R IT MAY CONTAIN
VIRTUAL DATA.

- DERIVED FROM THE

DATABASE FILES BUT NOT
EXPLICITLY STORED.

- SOFTWARE TO ENSURE THAT SEVERAL

USERS TRYING TO UPDATE THE SAME TYPE
OF DATA.

- -PROPERTY ENSURES
THAT EACH TRANSACTIONS
APPEARS TO EXECUTE

TRANSACTION PROPERTY

- PROPERTY ENSURES THAT THAT EITHER

ALL THE DATABASE OPERATIONS IN
TRANSACTIONS ARE EXECUTED.

-ADMINISTERING RESOURCES
- RESPONSIBLE FOR AUTHORIZING ACCESS
TO DATABASE.

-RESPONSIBLE FOR
IDENTIFYING THE DATA TO
BE STORED IN THE
DATABASE.

- PEOPLE WHOSE JOB REQUIRE ACCESS TO

THE DATABASE FOR QUERYING UPDATING
AND GENERATING REPORTS.

CATEGORIES OF END-USERS

- OCCASIONALLY ACCESS THE DATABASE

BUT THEY NEED DIFFERENT TYPE OF
INFORMATION EACH TIME.

- MAKES UP A SIZABLE
PORTION OF DATABASE END
USERS.

- CONSTANTLY QUERYING
AND UPDATING THE
DATABASE USING
STANDARD TYPES OF
QUERIES AND UPDATES.

- INCLUDE ENGINEERS
SCIENTIST BUSINESS
ANALYST

- MAINTAIN PERSONAL DATABASE BY USING

READYMADE PROGRAM PACKAGES THAT
EASY TO USE MENU BASED INTERFACE.

- DETERMINE THE REQUIREMENTS OF END-USERS,

ESPECIALLY NAVE AND PARAMETRIC END USERS AND
DEVELOP SPECIFICATIONS FOR STANDARD CANNED
TRANSACTION.

- IMPLEMENT
SPECIFICATIONS AS
PROGRAMS.

- DESIGN AND IMPLEMENT THE DBMS

MODULES AND INTERFACES AS A
SOFTWARE PACKAGE.

- COMPLEX SOFTWARE
SYSTEM THAT CONSISTS OF
MANY COMPONENTS.

WORKERS BEHIND THE

SCENE

- DESIGN AND IMPLEMENT

TOOLS.

-RESPONSIBLE FOR THE ACTUAL RUNNING

AND MAINTENANCE OF THE HARDWARE
AND SOFTWARE.

ADVANTAGES OF USING
DBMS APPROACH
CRPPE

- AUXILIARY FILES
ARE TYPICALLY BASED ON TREE DATA STRUCTURES OR
HASH DATA STRUCTURES THAT ARE SUITABLY MODIFIED
FOR DISK RESEARCH.

-RESPONSIBLE FOR
RECOVERY.

-RESPONSIBLE FOR
CHOOSING AN EFFICIENT
QUERY EXECUTION PLAN.

- FORM OF A RULE ACTIVATED BY UPDATES TO

THE TABLE WHICH RESULTS IN PERFORMING
SOME ADDITIONAL OPERATIONS.

IMPLICATIONS OF DATABASE
APPROACH
PAREF

- REPRESENTS ONE OR
MORE DATABASES.

- USED TO CONSOLIDATE A VARIETY OF

FUNCTIONAL AREAS WITHIN AN
ORGANIZATION.

-SOFTWARE THAT SPANS

ORDER PROCESSING AS
WELL AS MARKETING AND
CUSTOMER SUPPORT
FUNCTIONS.

-DEALS WITH BOOKS MANUSCRIPT AND

VARIOUS FORMS OF LIBRARY BASED
ARTICLES.

TWO TYPES OF MODULE

-DESIGNED SO THAT IT WILL RUN ON A

USER WORKSTATION OR PERSONAL
COMPUTER

- HANDLES DATA STORAGE ,

ACCESS SEARCH AND
OTHER FUNCTIONS.

- GENERALLY REFERS TO THE SUPPRESSION

OF DETAILS OF DATA ORGANIZATION AND
STORAGE.

- A COLLECTION OF CONCEPTS THAT CAN BE

USED TO DESCRIBE THE STRUCTURE OF
THE DATABASE.

CATEGORIES OF DATA
MODELS

- PROVIDE CONCEPTS THAT

ARE CLOSE TO THE WAY
MANY USERS PERCEIVED
DATA

- PROVIDE CONCEPT THAT

DESCRIBE THE DETAILS OF
HOW DATA IS STORED.

- PROVIDE CONCEPT THAT

MAYBE EASILY
UNDERSTOOD BY END
USERS

CONCEPTUAL DATA

- REPRESENTS THE REAL

WORLD

- REPRESENTS SOME PROPERTY OF

INTEREST THAT FURTHER DESCRIBE
ENTITIES.

- STRUCTURE THAT MAKES THE RESEARCH

FOR PARTICULAR DATABASE RECORDS
EFFICIENT

- ALLOWS DIRECT ACCESS

TO DATA USING AN INDEX
TERM OR KEY WORD.

- DESCRIPTION OF DATABASE WHICH

IS SPECIFIED DURING DATABASE
DESIGN AND IS NOT EXPECTED TO
CHANGE FREQUENTLY.

- DISPLAYED SCHEMA

IMPORTANT CHARACTERISTICS OF DATABASE APPROACH

UIS

- PROPOSED TO HELP ACHIEVE AND VISUALIZE

CHARACTERISTICS.
THREE SCHEMA ACHITECTURE

-DESCRIBE THE PHYSICAL

STORAGE STRUCTURE OF
DATABASE

- DESCRIBES THE PART OF THE DATABASE THAT A PARTICULAR

GROUP IS INTERESTED IN AND HIDES THE REST OF
DATABASE.
DESCRIBE THE STRUCTURE OF THE WHOLE DATABASE

- THE PROCESS OF
TRANSFORMING REQUEST
AND RESULTS BETWEEN
LEVELS.

TWO TYPES OF DATA

INDEPENDENCE

- CAPACITY TO CHANGE THE CONCEPTUAL SCHEMA

WITHOUT HAVING TO CHANGE THE EXTERNAL
SCHEMA OR APPLICATION PROGRAM.

- CAPACITY TO CHANGE THE INTERNAL

SCHEMA WITHOUT HAVING TO CHANGE THE
CONCEPTUAL SCHEMA.

DBMS LANGUAGES

- USED BY DBA AND

DATABASE DESIGNERS TO
DEFINE SCHEMA

- USED TO SPECIFY
INTERNAL SCHEMA

- USED TO SPECIFY USER VIEWS AND THEIR

MAP PINGS TO THE CONCEPTUAL SCHEMA

- PROVIDES SET OF
OPERATION OR A
LANGUAGE

TWO TYPES OF DML

- DML USED TO
STANDALONE INTERACTIVE
MANNER

- EMBEDDED IN A GEN PURPOSE PROGRAMMING LANGUAGE

DBMS INTERFACE

-CONCERNED WITH THE REARRANGEMENT

AND POSSIBLE REORDERING OF
OPERATIONS

- EXTRACTS DML COMMANDS FROM AN

APPLICATION PROGRAM WRITTEN IN A HOST
PROGRAMMING LANGUAGE.

DATABASE SYSTEM
UTILITIES
LBDP

- SYSTEM CONTAINING BOTH HARDWARE

AND SOFTWARE THAT CAN PROVIDE
SERVICES TO THE CLIENT MACHINES.

- PROVIDE SERVICES
INTERFACE CAPABILITIES
AND INTERFACE.

- USED TO LOAD EXISTING

FILE

-CREATES A BACKUP COPY

OF DATABASE

- USED TO REORGANIZED A SET OF

DATABASE FILES INTO DIFFERENT FILE
ORGANIZATION.

- MONITORS DATABASE
USAGE AND PROVIDES
STATISTICS.

- ALLOW USER AT
LOCATIONS REMOTE FROM
THE DATABASE SYSTEM
SITE TO ACCESS DATABASE
THROUGH COMPUTERS.

- DEVELOP TO DEAL WITH

COMPUTING
ENVIRONMENTS.

SPECIALIZED SERVER
CATEGORY
FPW

- PROVIDE THE USER WITH THE

APPROPRIATE INTERFACES TO UTILIZE
THESE SERVERS.

- ADDS AN IMMEDIATE
LAYER BETWEEN THE
CLIENT AND DATABASE
SERVER.

CLASSIFICATION OF
DATABASE MANAGEMENT
SYSTEM

DATA MODEL (HORN)

6 STEPS IN DATABASE
DESIGN PROCESS
RCLSPS

- IS AN OBJECT IN THE REAL

WORLD

- IS A COLLECTION OF
STRUCTURALLY IDENTICAL
ENTITIES.

- DESCRIBE ENTITIES

- A MINIMAL SET OF ATTRIBUTES WHOSE

VALUES UNIQUELY IDENTIFY AN ENTITY IN
THE SET.

- IS AN ASSOCIATION
AMONG TWO OR MORE
ENTITIES

- COLLECTION OF RELATIONSHIP THAT

RELATE ENTITIES FROM THE SAME ENTITY
SET

-USED TO RECORD
INFORMATION ABOUT THE
RELATIONSHIP .

- BETWEEN AN ENTITY SET AND A RELATIONSHIP

SET BY REQUIRING THAT EACH ENTITY
PARTICIPATE IN AT MOST ONE RELATIONSHIP.

- CONCEPTUALLY
TRANSFORMS A
RELATIONSHIP SET INTO AN
ENTITY SET .

CLASS HIERARCHY CAN BE

VIEWED IN TWO WAYS

- PROCESS OF IDENTIFYING
SUBSETS OF AN ENTITY SET.

- CONSISTS OF IDENTIFYING SOME

COMMON CHARACTERISTICS OF A
COLLECTION OF ENTITY.

CHAPTER 3

-STANDARD LANGUAGE FOR

CREATING MANIPULATING
AND QUERYING DATA.

- MAIN CONSTRUCT FOR

REPRESENTING DATA IN THE
RELATIONAL MODEL.

- SPECIFIES THE RELATION

NAME , NAME OF EACH
FIELD AND THE DOMAIN OF
EACH FIELD.

- IS A SET OF TYPES ALSO CALLED RECORDS IN

WHICH EACH TUPLE HAS THE SAME NUMBER
OF FIELDS AS THE RELATION SCHEMA.

- SPECIFY AN IMPORTANT CONDITION THAT

WE WANT EACH INSTANCE OF THE
RELATION TO SATISFY.

- ANGULAR BRACKETS
DENOTES

- CURLY BRACKETS
DENOTES

- VERTICAL BAR READ AS

- ALSO CALLED ARITY OF A

RELATION IS THE NUMBER
OF FIELDS.

- COLLECTION OF RELATION
WITH DISTINCT RELATION
NAMES.

- COLLECTION OF SCHEMAS
FOR THE RELATIONS IN THE
DATABASE.

- COLLECTION OF RELATION INSTANCES

ONE PER RELATION SCHEMA IN THE
DATABASE SCHEMA.

- LANGUAGE STANDARD
USES THE WORD TABLE TO
DENOTE RELATION.

-USED TO DEFINE A NEW

TABLE

- MODIFY THE COLUMN

VALUES IN AN EXISTING
ROW.

- APPLIED FIRST AND

DETERMINES WHICH ROWS
ARE TO BE MODIFIED.

- DETERMINES HOW ROWS

TO BE MODIFIED.

- IS A CONDITION THAT IS SPECIFIED ON A

DATABASE SCHEMA AND RESTRICTS THE
DATA THAT CAN BE STORED IN AN INSTANCE.

- A SET OF FIELDS THAT

UNIQUELY IDENTIFIES A
TUPLE ACCORDING TO A
KEY CONSTRAINT.

- IS A STATEMENT THAT A
CERTAIN MINIMAL SUBSET
OF THE FIELDS OF A
RELATION IS A UNIQUE
IDENTIFIER FOR A TUPLE.

- IS A SET OF FIELDS THAT

CONTAINS A KEY.

- THE MOST COMMON IC

INVOLVING TWO RELATION.

- IS A QUESTION ABOUT THE

DATA AND THE ANSWER
CONSIST OF A NEW
RELATION CONTAINING THE
RESULT.

- SPECIALIZED LANGUAGE
FOR WRITING QUERIES.

- IS THE MOST POPULAR

COMMERCIAL QUERY
LANGUAGE FOR A
RELATIONAL DBMS.

- CONVENIENT FOR
REPRESENTING AN INITIAL,
HIGH LEVEL DATABASE
DESIGN.

- MAPPED TO A RELATION IN
A STRAIGHT FORWARD WAY.

- SUPER KEY FOR THE

RELATION

- TABLE WHOSE ROWS ARE NOT EXPLICITLY

STORED IN THE DATABASE BUT ARE COMPUTED
AS NEEDED FROM A VIEW DEFINITION.

- DESCRIBES HOW THE RELATIONS IN THE

CONCEPTUAL SCHEMA ARE STORED IN TERMS
OF FILE ORGANIZATIONS AND INDEXES USED.

- IS THE COLLECTION OF
SCHEMAS OF THE
RELATIONS STORED IN THE
DATABASE.

- PROVIDES THE SUPPORT FOR LOGICAL

DATA INDEPENDENCE IN THE RELATIONAL
MODEL.

- MODIFIES THE STRUCTURE OF AN EXISTING TABLE.

ALSO BE USED TO DELETE COLUMNS AND TO ADD OR
DROP IC ON A TABLE.

- MAIN ELEMENT OF
RELATIONAL MODEL

- DESCRIBES THE STRUCTURE OF A

RELATION BY SPECIFYING THE RELATION
NAME AND THE NAME OF EACH FIELD.

NUMBER OF FIELDS IS
CALLED _______

- IS AN ACTUAL TABLE THAT CONTAINS A

SET OF TUPLE SO THAT ADHERE TO THE
RELATION SCHEMA.

NUMBER OF TUPLE A IS
CALLED _______

- ENABLES THE CREATION

AND MODIFICATION OF
RELATIONS.

- ARE CONDITIONS ON A DATABASE

SCHEMA THAT EVERY LEGAL DATABASE
INSTANCE HAS TO SATISFY.

TYPES OF INTEGRITY
CONSTRAINTS

- QUESTION ABOUT THE

DATA.

CHAPTER 7

- REFERS TO A PARTICULAR DATABASE AND

ASSOCIATED PROGRAMS THAT IMPLEMENT
THE DATABASE QUERIES AND UPDATES.

- INCREASINGLY POPULAR IN
BOTH DATABASE AND
SOFTWARE DESIGN.

- CONCISE DESCRIPTION OF
THE DATA REQUIREMENTS
OF THE USERS

- USED AS A REFERENCE TO ENSURE THAT

ALL USERS DATA REQUIREMENTS ARE MET
AND THE REQUIREMENTS DO NOT COMPLICIT.

- ACTUAL IMPLEMENTATION
OF THE DATABASE USING A
COMMERCIAL DBMS.

- INTERNAL STORAGE STRUCTURES, FILE

ORGANIZATION, INDEXES, ACCESS PATH ARE
SPECIFIED.

- IS A THING IN THE REAL

WORLD WITH AN
INDEPENDENT EXISTENCE.

- ATTRIBUTES THAT ARE

NOT DIVISIBLE.

- SINGLE VALUE FOR A

PARTICULAR ENTITY.

- HAVE A LOWER AND UPPER BOUNDS TO

CONSTRAIN THE NUMBER OF VALUES
ALLOWED FOR EACH INDIVIDUAL ENTITY.

- DEFINES A COLLECTION OF
ENTITIES THAT HAVE THE
SAME ATTRIBUTES.

- COLLECTION OF ALL ENTITIES OF A

PARTICULAR ENTITY TYPE IN THE
DATABASE AT ANY POINT IN TIME.

- AN IMPORTANT
CONSTRAINT ON THE
ENTITIES OF AN ENTITY
TYPE.

- AN ENTITY TYPE USUALLY HAS ONE OR MORE ATTRIBUTES

WHOSE VALUES ARE DISTINCT FOR EACH INDIVIDUAL ENTITY IN
THE ENTITY SET.
IT'S VALUES CAN BE USED TO IDENTIFY EACH ENTITY UNIQUELY.

- SPECIFIES THE SET OF VALUES THAT MAY

BE ASSIGNED TO THAT ATTRIBUTE FOR
EACH INDIVIDUAL ENTITY.

- DEFINES A SET OF ASSOCIATION OR A

RELATIONSHIP SETS AMONG ENTITIES FROM
THESE VARIETY TYPES.

- NUMBER OF PARTICIPATING
TYPES.

- RELATIONSHIP TYPE OF
DEGREE TWO.

- SIGNIFIES THE ROLE THAT A PARTICIPATING

ENTITY FROM THE ENTITY TYPE PLAYS IN
EACH RELATIONSHIP INSTANCE.

- DETERMINED FROM THE MINIWORLD

SITUATION THAT THE RELATIONSHIP
REPRESENT.

TWO TYPES OF BINRY

RELATIONSHIP.

- SPECIFIES THE MAXIMUM NUMBER OF

RELATIONSHIP INSTANCES THAT AN ENTITY
CAN PARTICIPATE IN.

- SPECIFIES WHETHER THE EXISTENCE OF AN

ENTITY DEPENDS ON ITS BEING RELATED TO
ANOTHER ENTITY VIA RELATIONSHIP TYPE.

- THIS CONSTRAINT SPECIFIES THE

MINIMUM NUMBER OF RELATIONSHIP
INSTANCES.

TWO TYPES OF
PARTICIPATION CONSTRAINT

TOTAL PARTICIPATION IS
ALSO CALLED _______.

- ENTITY TYPE THAT DO NOT

HAVE KEY ATTRIBUTES OF
THEIR OWN.

- UNIQUELY IDENTIFY WEAK ENTITIES THAT

ARE RELATED TO THE SAME OWNER
ENTITY.

SYMBOL >>>> MEANING

PAGE 223

TYPES OF ATTRIBUTES.

TWO TYPES OF
STRUCTURAL CONSTRAINTS.

- CAN BE REPRESENTED
DIAGRAMMATICALLY AS ER
DIAGRAMS.