Introduction to Database Systems CSE 444 Lecture 23: Final Review

Slides:



Advertisements
Similar presentations
CS 540 Database Management Systems
Advertisements

Review for Final Test Indra Budi
Final Exam Coverage. E/R Converting E/R to Relations. SQL. –Joins and outerjoins –Subqueries –Aggregations –Views –Inserts, updates, deletes –Ordering.
Midterm Review Lecture 14b. 14 Lectures So Far 1.Introduction 2.The Relational Model 3.Disks and Files 4.Relational Algebra 5.File Org, Indexes 6.Relational.
1 Review #1 l Intro stuff –What is a database, 4 parts, 3 users, etc. l Architecture –Data independence –Three levels, two mappings –Jobs of the DBA.
All of ERD (Ch 3) plus: – Class/subclass relationships – Inheritance – Specialization – Generalization – Category.
Summary. Chapter 9 – Triggers Integrity constraints Enforcing IC with different techniques –Keys –Foreign keys –Attribute-based constraints –Schema-based.
...Looking back Why use a DBMS? How to design a database? How to query a database? How does a DBMS work?
Slide Dr. Almetwally Mohamad Mostafa spx is335.
CS505: Final Exam Review Jinze Liu. Major Topics Before Mid-Term – Security and Access Control – Indexing After Mid-Term – Transaction Management Locking,
Copyright © 2004 Pearson Education, Inc.. Chapter 15 Algorithms for Query Processing and Optimization.
1 Final Review Tuesday, March 6, The Final Date: Tuesday, March 13, 2007 Time: 6:30 - 8:30 Room: EE 037 You must come to campus Open book exam.
Introduction.  Administration  Simple DBMS  CMPT 454 Topics John Edgar2.
1 CSE444: REVIEW. 2 CSE444 in one slide v Logical : E/R diagram  normalized relations v Physical : files, buffering, and indexes v Logical : Relational.
CSE 303 Course Outline (Part 2) Text Book: Database System Concepts 6 th Edition by Abraham Silberschatz, Henry F. Korth and S. Sudarshan.
Lecture 15: Query Optimization. Very Big Picture Usually, there are many possible query execution plans. The optimizer is trying to chose a good one.
CS411 Database Systems Kazuhiro Minami 16: Final Review Session.
CHAPTER 19 Query Optimization. CHAPTER 19 Query Optimization.
CF 1334 Sistem Basis Data (3 SKS)
Diskusi-08 Jelaskan dan berikan contoh penggunaan theta join, equijoin, natural join, outer join, dan semijoin The slides for this text are organized into.
Diskusi-5 Sebutkan perangkat (tools) yang berpotensi mendukung kebutuhan tugas-tugas manajerial (management work) Jelaskan enam karakteristik informasi.
CS422 Principles of Database Systems Course Overview
MODELS OF DATABASE AND DATABASE DESIGN
Diskusi-1 Bacalah materi chapter-01, lalu buatlah ringkasan yang berisi tentang : Definisi EUIS Siapa end user Dampak euis pada lingkungan kerja Perencanaan.
DBMS QUESTIONS AND ANSWERS
Latihan Answer the following questions using the relational schema from the Exercises at the end of Chapter 3: Create the Hotel table using the integrity.
Prepared by : Ankit Patel (226)
Diskusi-16 Buatlah ringkasan tentang pertimbangan dalam desain yang ergonomis pada tiga perangkat utama komputer yaitu monitor, keyboard dan mouse (lihat.
CPSC-310 Database Systems
Latihan Create a separate table with the same structure as the Booking table to hold archive records. Using the INSERT statement, copy the records from.
Tugas-05 a. Sebutkan primary key masing-masing tabel
Introduction to Query Optimization
Relational Algebra Chapter 4, Part A
The Entity-Relationship Model
Modeling Your Data Chapter 2 cs542
Translation of ER-diagram into Relational Schema
COSC 6340 Projects & Homeworks Spring 2002
Examples of Physical Query Plan Alternatives
Cse 344 May 7th – Exam Review.
From ER to Relational Model
The Entity-Relationship Model
February 7th – Exam Review
Database management concepts
External Sorting The slides for this text are organized into chapters. This lecture covers Chapter 11. Chapter 1: Introduction to Database Systems Chapter.
Faloutsos/Pavlo C. Faloutsos – A. Pavlo Lecture#27: Final Review
Team Project, Part II NOMO Auto, Part II IST 210 Section 4
Relational Algebra Chapter 4, Sections 4.1 – 4.2
The PROCESS of Queries John Deardurff
Final Review Topics Chapter 4 SQL,
Final Review Datalog (Ch 10) Rules and queries
Cse 344 June 1st – Final Review.
The PROCESS of Queries John Deardurff
Database management concepts
Lecture 30: Final Review Wednesday, December 6, 2000.
Contents Preface I Introduction Lesson Objectives I-2
CS4433 Database Systems Midterm Review.
Wednesday, May 29, 2002 XML Storage Final Review
Evaluation of Relational Operations: Other Techniques
Review for Final Exam CSE462 B.Ramamurthy.
CSE594: REVIEW.
Database Systems (資料庫系統)
Lecture 24: Final Review Friday, March 10, 2006.
Lecture 30: Final Review Wednesday, December 10, 2003.
Query Optimization.
Introduction to Database Systems CSE 444 Lecture 23: Final Review
Final Review Friday, December 8, 2006.
Review #1 Intro stuff What is a database, 4 parts, 3 users, etc.
Physical Database Design
File Organizations and Indexing
Lecture 29: Final Review Wednesday, December 11, 2002.
Presentation transcript:

Introduction to Database Systems CSE 444 Lecture 23: Final Review December 7, 2007

The Final Date: Monday, December 10 Time: 10:30 - 12:20 Place: this room Open book exam (textbook, course slides)

Topic 1 Data modeling Relational model SQL

Data Modeling E/R diagrams Keys Relationships Inheritance Mapping to relations

Relational Model Relations Keys Functional dependencies Decomposition Normal forms

SQL Select-from-where Subqueries Aggregation Nulls Outer joins

SQL (continued) Database modification Defining and modifying relation schemas Constraints On attribute values Keys Foreign keys

Topic 2: XML Xquery/Xpath XML syntax DTD From relations to XML From XML to relations

Topic 3: Transactions ACID properties Recovery Concurrency

Recovery Undo log Redo log Undo/redo log

Concurrency control Serializability Conflict serializability Locks Timestamps Validation

Topic 4: Query Evaluation Indexes Physical operators Optimizations

Index Structures Terminology: B+-trees Dense/sparse index Primary/secondary index B+-trees

Physical Operators One-pass algorithms Nested-loop joins Two-pass algorithms based on sorting Two-pass algorithms based on hash tables Index-based algorithms

Optimizations Algebra Algebraic laws Dynamic programming Pipelining Check that you know how to convert from SQL Algebraic laws Which of these expressions are equal ? What if we have keys/foreign keys ? Dynamic programming Pipelining You should be able to discuss alternative choices of query plans

General Advice Some problems will require thinking Use judgment Problem difficulty may be uneven: do the easy ones first

COMMIT (The End)