Presentation is loading. Please wait.

Presentation is loading. Please wait.

Relational Databases Week 9 INFM 603.

Similar presentations

Presentation on theme: "Relational Databases Week 9 INFM 603."— Presentation transcript:

1 Relational Databases Week 9 INFM 603

2 Agenda Questions Relational database design Microsoft Access MySQL

3 Databases Database DataBase Management System (DBMS)
Collection of data, organized to support access Models some aspects of reality DataBase Management System (DBMS) Software to create and access databases Relational Algebra Special-purpose programming language

4 Structured Information
Field An “atomic” unit of data number, string, true/false, … Record A collection of related fields Table A collection of related records Each record is one row in the table Each field is one column in the table Primary Key The field that identifies a record Values of a primary key must be unique Database A collection of tables

5 A Simple Example primary key

6 Registrar Example Which students are in which courses?
What do we need to know about the students? first name, last name, , department What do we need to know about the courses? course ID, description, enrolled students, grades

7 Why is this a bad approach?
A “Flat File” Solution Discussion Topic Why is this a bad approach?

8 Goals of “Normalization”
Save space Save each fact only once More rapid updates Every fact only needs to be updated once More rapid search Finding something once is good enough Avoid inconsistency Changing data once changes it everywhere

9 Relational Algebra Tables represent “relations”
Course, course description Name, address, department Named fields represent “attributes” Each row in the table is called a “tuple” The order of the rows is not important Queries specify desired conditions The DBMS then finds data that satisfies them

10 A Normalized Relational Database
Student Table Department Table Course Table Enrollment Table

11 Approaches to Normalization
For simple problems Start with “binary relationships” Pairs of fields that are related Group together wherever possible Add keys where necessary For more complicated problems Entity relationship modeling

12 Example of Join Student Table Department Table “Joined” Table

13 Problems with Join Data modeling for join is complex
Useful to start with E-R modeling Join are expensive to compute Both in time and storage space But it’s joins that make databases relational Projection and restriction also used in flat files

14 Some Lingo “Primary Key” uniquely identifies a record
e.g. student ID in the student table “Compound” primary key Synthesize a primary key with a combination of fields e.g., Student ID + Course ID in the enrollment table “Foreign Key” is primary key in the other table Note: it need not be unique in this table

15 Project New Table SELECT Student ID, Department

16 Restrict New Table WHERE Department ID = “HIST”

17 Entity-Relationship Diagrams
Graphical visualization of the data model Entities are captured in boxes Relationships are captured using arrows

18 Registrar ER Diagram Student Student ID First name Last name
Department Enrollment Student Course Grade has associated with has Course Course ID Course Name Department Department ID Department Name

19 Getting Started with E-R Modeling
What questions must you answer? What data is needed to generate the answers? Entities Attributes of those entities Relationships Nature of those relationships How will the user interact with the system? Relating the question to the available data Expressing the answer in a useful form

20 “Project Team” E-R Example
manage-role 1 1 member-of M student team 1 M creates human implement-role 1 M needs 1 client project d php-project ajax-project

21 Components of E-R Diagrams
Entities Types Subtypes (disjoint / overlapping) Attributes Mandatory / optional Identifier Relationships Cardinality Existence Degree

22 Types of Relationships
Many-to-Many 1-to-Many 1-to-1

23 Making Tables from E-R Diagrams
Pick a primary key for each entity Build the tables One per entity Plus one per M:M relationship Choose terse but memorable table and field names Check for parsimonious representation Relational “normalization” Redundant storage of computable values Implement using a DBMS

24 1NF: Single-valued indivisible (atomic) attributes
Split “Doug Oard” to two attributes as (“Doug”, “Oard”) Model M:M implement-role relationship with a table 2NF: Attributes depend on complete primary key (id, impl-role, name)->(id, name)+(id, impl-role) 3NF: Attributes depend directly on primary key (id, addr, city, state, zip)->(id, addr, zip)+(zip, city, state) 4NF: Divide independent M:M tables (id, role, courses) -> (id, role) + (id, courses) 5NF: Don’t enumerate derivable combinations

25 Normalized Table Structure
Persons: id, fname, lname, userid, password Contacts: id, ctype, cstring Ctlabels: ctype, string Students: id, team, mrole Iroles: id, irole Rlabels: role, string Projects: team, client, pstring

26 Making Tables from E-R Diagrams

27 Database Integrity Registrar database must be internally consistent
Enrolled students must have an entry in student table Courses must have a name What happens: When a student withdraws from the university? When a course is taken off the books?

28 Integrity Constraints
Conditions that must always be true Specified when the database is designed Checked when the database is modified RDBMS ensures integrity constraints are respected So database contents remain faithful to real world Helps avoid data entry errors

29 Referential Integrity
Foreign key values must exist in other table If not, those records cannot be joined Can be enforced when data is added Associate a primary key with each foreign key Helps avoid erroneous data Only need to ensure data quality for primary keys

30 Database “Programming”
Natural language Goal is ease of use e.g., Show me the last names of students in CLIS Ambiguity sometimes results in errors Structured Query Language (SQL) Consistent, unambiguous interface to any DBMS Simple command structure: e.g., SELECT Last name FROM Students WHERE Dept=CLIS Useful standard for inter-process communications Visual programming (e.g., Microsoft Access) Unambiguous, and easier to learn than SQL

31 Using Microsoft Access
Create a database called M:\rides.mdb File->New->Blank Database Specify the fields (columns) “Create a Table in Design View” Fill in the records (rows) Double-click on the icon for the table

32 Creating Fields Enter field name Select field type from a menu
Must be unique, but only within the same table Select field type from a menu Use date/time for times Use text for phone numbers Designate primary key (right mouse button) Save the table That’s when you get to assign a table name

33 Entering Data Open the table Enter new data in the bottom row
Double-click on the icon Enter new data in the bottom row A new (blank) bottom row will appear Close the table No need to “save” – data is stored automatically

34 Building Queries Copy ride.mdb to your C:\ drive
“Create Query in Design View” In “Queries” Choose two tables, Flight and Company Pick each field you need using the menus Unclick “show” to not project Enter a criterion to “restrict” Save, exit, and reselect to run the query

35 Fun Facts about Queries
Joins are automatic if field names are same Otherwise, drag a line between the fields Sort order is easy to specify Use the menu

36 The SQL SELECT Command Project chooses columns Restrict chooses rows
Based on their label Restrict chooses rows Based on their contents e.g. department ID = “HIST” These can be specified together SELECT Student ID, Dept WHERE Dept = “History”

37 Restrict Operators Each SELECT contains a single WHERE
Numeric comparison <, >, =, <>, … e.g., grade<80 Boolean operations e.g., Name = “John” AND Dept <> “HIST”

38 Structured Query Language

39 Structured Query Language

40 Structured Query Language
SELECT Company.CompanyName, Company.CompanyPhone, Flight.Origin, Flight.DepartureTime FROM Flight,Company WHERE Flight.CompanyName=Company.CompanyName AND Flight.AvailableSeats>3;

41 where employee.surname='Smith' and employee.forenames='Robert';
field select address from employee where employee.surname='Smith' and employee.forenames='Robert'; table how you want to restrict the rows

42 field tables to join select dname from employee, department where employee.depno=department.depno and surname='Smith' and forenames='Robert'; how to join how you want to restrict the rows

43 Create a MySQL Database
“root” user creates database + grants permissions Using the WAMP console (or mysql –u root –p) root has no initial password; just hit <enter> when asked By the system administrator account CREATE DATABASE project; GRANT SELECT, INSERT, UPDATE, DELETE, INDEX, ALTER, CREATE, DROP ON project.* TO IDENTIFIED BY ‘bar’; FLUSH PRIVILEGES; Start mysql MySQL console for WAMP: mysql –u foo –p bar Connect to your database USE project;

44 Creating Tables To delete: DROP TABLE contacts;

45 Populating Tables To empty a table: DELETE FROM ctlabels;
INSERT INTO ctlabels (string) VALUES ('primary '), ('alternate '), ('home phone'), ('cell phone'), ('work phone'), ('AOL IM'), ('Yahoo Chat'), ('MSN Messenger'), (‘other’); To empty a table: DELETE FROM ctlabels;

46 “Looking Around” in MySQL

47 Databases in the Real World
Some typical database applications: Banking (e.g., saving/checking accounts) Trading (e.g., stocks) Airline reservations Characteristics: Lots of data Lots of concurrent access Must have fast access “Mission critical”

48 Caching servers: 15 million requests per second, 95% handled by memcache (15 TB of RAM)
Database layer: 800 eight-core Linux servers running MySQL (40 TB user data) Source: Technology Review (July/August, 2008)

49 Concurrency Thought experiment: You and your project partner are editing the same file… Scenario 1: you both save it at the same time Scenario 2: you save first, but before it’s done saving, your partner saves Whose changes survive? A) Yours B) Partner’s C) neither D) both E) ??? 4

50 Concurrency Example Possible actions on a checking account Scenario:
Deposit check (read balance, write new balance) Cash check (read balance, write new balance) Scenario: Current balance: $500 You try to deposit a $50 check and someone tries to cash a $100 check at the same time Possible sequences: (what happens in each case?) Deposit: read balance Deposit: write balance Cash: read balance Cash: write balance Deposit: read balance Cash: read balance Cash: write balance Deposit: write balance Deposit: read balance Cash: read balance Deposit: write balance Cash: write balance

51 Database Transactions
Transaction: sequence of grouped database actions e.g., transfer $500 from checking to savings “ACID” properties Atomicity All-or-nothing Consistency Each transaction must take the DB between consistent states. Isolation: Concurrent transactions must appear to run in isolation Durability Results of transactions must survive even if systems crash

52 Making Transactions Idea: keep a log (history) of all actions carried out while executing transactions Before a change is made to the database, the corresponding log entry is forced to a safe location Recovering from a crash: Effects of partially executed transactions are undone Effects of committed transactions are redone the log

53 Utility Service Desk Exercise
Design a database to keep track of service calls for a utility company: Customers call to report problems Call center manages “tickets” to assign workers to jobs Must match skills and service location Must balance number of assignments Workers call in to ask where their next jobs are In SQL, you can do the following operations: Count the number of rows in a result set Sort the result set according to a field Find the maximum and minimum value of a field

54 Key Ideas Databases are a good choice when you have
Lots of data A problem that contains inherent relationships Join is the most important concept Project and restrict just remove undesired stuff Design before you implement Managing complexity is important

Download ppt "Relational Databases Week 9 INFM 603."

Similar presentations

Ads by Google