Download Selling an Idea or a Product

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Expense and cost recovery system (ECRS) wikipedia , lookup

Operational transformation wikipedia , lookup

Data center wikipedia , lookup

Data analysis wikipedia , lookup

Entity–attribute–value model wikipedia , lookup

Information privacy law wikipedia , lookup

Data model wikipedia , lookup

SAP IQ wikipedia , lookup

3D optical data storage wikipedia , lookup

Data vault modeling wikipedia , lookup

Concurrency control wikipedia , lookup

Versant Object Database wikipedia , lookup

Business intelligence wikipedia , lookup

Open data in the United Kingdom wikipedia , lookup

Relational model wikipedia , lookup

Database wikipedia , lookup

Clusterpoint wikipedia , lookup

Database model wikipedia , lookup

Transcript
Today
 Course
overview
 What is a database?
 Main Characteristics of Database Technology
 Data Models
 Schemas and Instances
 DBMS Languages
 Database System Utilities
Course overview
Website:
http://www.cs.laurentian.ca/kpassi/cosc2307.html
 Instructor:

» Kalpdrum Passi ([email protected])

Key dates:
– Lectures: MWF 11:30AM-12:30AM in C-112
– Midterm1: Friday, October 1, 2004
– Midterm2: Monday, November 1, 2004
Course Overview (Continued)

Material:
– Lecture notes – On website.
– Textbook – J. Morrison, M. Morrison, Enhanced Guide
to Oracle 9i, 2003, Thompson Learning.

Prerequisites:
– Java – (COSC 1046)

Grading Policy
–
–
–
–
Home Works:
Term Exam (2)
Surprise Quiz
Final Exam:
30%
30%
10%
30%
Give me a sign you learned the material.
Word of warning

I have a firm belief in you learn by doing.
– You learn database concepts by implementing it!

Key Course Features
– Most of the work comes from home works.
– Exams will be based on your understanding of the
concepts and home works; if you don’t do the home works
you are likely to do poorly in your exams.
– Home works will be checked for cheating. Any two home
works found to be the same will be given zero and serious
action can be taken.
– Home works are individual assignments and not to be
worked in groups.
– You will learn a lot! You will have to work hard!
Basic Definitions



Database: A collection of related data.
Data: Known facts that can be recorded and have an
implicit meaning.
Mini-world: Some part of the real world about which
data is stored in a database.
– For example, consider student names, student grades and
transcripts at a university.
Basic Definitions (cont.)
Database Management System (DBMS): A software
package/ system to facilitate the creation and
maintenance of a computerized database. It
– defines (data types, structures, constraints)
– construct DBMS (storing data on some storage medium
controlled by DBMS)
– manipulate (querying, update, report generation)
databases for various applications.
Database System: The DBMS software together with
the data itself. Sometimes, the applications are also
included.
Example of a Database


Mini-world for the example: Part of a UNIVERSITY
environment.
Some mini-world entities (Data elements):
–
–
–
–
–

STUDENTs
COURSEs
SECTIONs (of COURSEs)
(academic) DEPARTMENTs
INSTRUCTORs
Some mini-world relationships:
–
–
–
–
–
–
SECTIONs are of specific COURSEs
STUDENTs take SECTIONs
COURSEs have prerequisite COURSEs
INSTRUCTORs teach SECTIONs
COURSEs are offered by DEPARTMENTs
STUDENTs major in DEPARTMENTs
A simplified database system environment
An Example database that stores student
records
File Processing and DBMS
File Systems :
– Store data over long periods of time
– Store large amount of data
However :
–
–
–
–
–
–
–
–
–
No guarantee that data is not lost if not backed up
No support to query languages
No efficient access to data items unless the location is known
Data definition is typically part of application programs – hence
these programs are constrained to work with only one specific
database.
Change to data definition will affect the application programs
Single view of the data
Separate files for each application
Limited control to multiple accesses
Data viewed as physically stored
Main Characteristics of Database
Technology

Self-describing nature of a database system: A DBMS catalog
stores the description (structure, type & storage format of
each data item and constraints on data) of the database.
– The description is called meta-data.
– This allows the DBMS software to work equally well with different
database applications as long as the database definition is stored
in the catalog.

Insulation between programs and data: Called program-data
independence.
– Allows changing data storage structures and operations without
having to change the DBMS access programs.

Data Abstraction: A data model is used to hide storage details
and present the users with a conceptual view of the database;
does not include how data is stored and how the operations are
implemented.
Main Characteristics of Database
Technology (cont.)

A database user is not concerned with the location of
a data item, rather with the reference to the data
item
Internal storage format for a student record
Main Characteristics of Database
Technology (cont.)


Support of multiple views of the data: Each user may
see a different view of the database, which describes
only the data of interest to that user.
Sharing of Data and Multiuser Transaction Processing:
A multiuser DBMS allows multiple users to access the
database at the same time and ensures that
concurrent transactions operate correctly.
– These types of applications are called On-Line Transaction
Processing (OLTP).
Main Characteristics of Database
Technology (cont.)
Two views derived from the example database shown in Figure
1.2 (a) The student transcript view. (b) The course
prerequisite view
Main Characteristics of Database
Technology (cont.)




Actors on the Scene
DBA – Database Administrator
– Responsible for authorizing access to the database,
coordinating, monitoring its use, acquiring hardware,
software needed.
Database designers
– Responsible for identifying the data to be stored, storage
structure to represent and store data. This is done by a
team of professionals in consultation with users, and
applications needed.
End Users
Data Models
Data Model: A set of concepts to describe the
structure (data types, relationships) of a database,
and certain constraints that the database should
obey.
Data Model Operations: Operations for specifying
database retrievals and updates by referring to the
concepts of the data model.
Data Models (Categories)



Conceptual (high-level, semantic) data models: Provide concepts
that are close to the way many users perceive data. (Also
called entity-based or object-based data models.)
Physical (low-level, internal) data models: Provide concepts
that describe details of how data is stored in the computer.
Implementation (record-oriented) data models: Provide
concepts that fall between the above two, balancing user views
with some computer storage details.
Data Models (History)


Relational Model: proposed in 1970 by E.F. Codd (IBM), first
commercial system in 1981-82. Now in several commercial
products (ORACLE, SYBASE, INFORMIX, INGRES).
Network Model: the first one to be implemented by Honeywell
in 1964-65 (IDS System).
– Adopted heavily due to the support by CODASYL (CODASYL DBTG report of 1971)
– Later implemented in a large variety of systems - IDMS (Cullinet now CA), DMS 1100 (Unisys), IMAGE (H.P.), VAX -DBMS (Digital).

Hierarchical Data Model : implemented in a joint effort by IBM
and North American Rockwell around 1965. Resulted in the IMS
family of systems. The most popular model.
– Other system based on this model: System 2k (SAS inc.)
Data Models (History)

Object-oriented Data Model(s) : several models have
been proposed for implementing in a database system.
– One set comprises models of persistent O-O Programming
Languages such as C++ (e.g., in OBJECTSTORE or
VERSANT), and Smalltalk (e.g., in GEMSTONE).
– Additionally, systems like O2, ORION (at MCC - then
ITASCA), IRIS (at H.P.- used in Open OODB).

Object-Relational Models : Most Recent Trend.
Exemplified in ILLUSTRA and UNiSQL systems
Schemas versus Instances





Database Schema: The description of a database. Includes
descriptions of the database structure and the constraints that
should hold on the database.
Schema Diagram: A diagrammatic display of (some aspects of) a
database Schema (next slide)
Database Instance: The actual data stored in a database at a
particular moment in time . Also called database state (or
occurrence).
The database schema changes very infrequently . The database state
changes every time the database is updated . Schema is also called
intension, whereas state is called extension.
Schema Evolution: changes applied to a schema.
Schemas versus Instances (cont.)
Schema Diagram for Student Database
DBMS Languages




Data Definition Language (DDL): Used by the DBA and
database designers to specify the conceptual schema of a
database.
In many DBMSs, the DDL is also used to define internal and
external schemas (views). In some DBMSs, separate storage
definition language (SDL) and view definition language (VDL)
are used to define internal and external schemas.
Data Manipulation Language (DML): Used to manipulate the
database - includes retrieval, insertion, deletion and updates.
In current DBMS, a comprehensive integrated language is used
that includes constructs for conceptual schema definition, view
definition and data manipulation – e.g. SQL represents a
combination of DDL, VDL, and DML, statements for constraint
specification and schema evolution
DBMS Languages (cont.)
DML commands (data sublanguage) can be embedded
in a general-purpose programming language (host
language), such as Java, COBOL, PL/1 or PASCAL.
 Alternatively, stand-alone DML commands can be
applied directly (query language).

DBMS Languages (cont.)


Two types of DML:
High Level or non-Procedural DML – Describes what data to be
retrieved rather than how to retrieve.
– Process many records in a single DML statement
(set-at-a-time or set-oriented)
– SQL
– Declarative languages

Low Level or Procedural DML – It needs constructs for both,
what to retrieve and how to retrieve
– Embedded in a general-purpose programming language.
– Retrieves individual records or objects from the database and
processes each separately.
– Uses looping construct in programming languages to retrieve and
process each record (record-at-a-time).
Database System Utilities

To perform certain functions such as:
–
–
–
–
–
–

Loading data stored in files into a database.
Backing up the database periodically on tape.
Reorganizing database file structures.
Report generation utilities.
Performance monitoring utilities.
Other functions, such as sorting , user monitoring , data
compression , etc.
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.