1 Announcements Project Due Friday 5:00 PM Group Presentations –10 minutes –Describe project (ERD), discuss any challenges, show us some queries Final.

Slides:



Advertisements
Similar presentations
Relational Database Design Via ER Modelling
Advertisements

Copyright © 2015 Pearson Education, Inc. Database Design Chapters 17 and
Systems Development Life Cycle
Database Systems: Design, Implementation, and Management Tenth Edition
BTrees & Bitmap Indexes
Entity Relationship Diagrams Basic Elements and Rules.
IMS1805 Systems Analysis Topic 3: Doing analysis (cont from Monday)
© 2008 Pearson Prentice Hall, Experiencing MIS, David Kroenke
©Silberschatz, Korth and Sudarshan12.1Database System Concepts Chapter 12: Part B Part A:  Index Definition in SQL  Ordered Indices  Index Sequential.
CS 206 Introduction to Computer Science II 12 / 01 / 2008 Instructor: Michael Eckmann.
1 Lecture 20: Indexes Friday, February 25, Outline Representing data elements (12) Index structures (13.1, 13.2) B-trees (13.3)
B+ - Tree & B - Tree By Phi Thong Ho.
B-Trees. CSM B-Trees 2 Motivation for B-Trees So far we have assumed that we can store an entire data structure in main memory What if we have so.
Index Structures Parin Shah Id:-207. Topics Introduction Structure of B-tree Features of B-tree Applications of B-trees Insertion into B-tree Deletion.
CS 255: Database System Principles slides: B-trees
Announcements Reading for Wednesday Homework 2 - Due 9/22
Entity Relationship Model Chapter 6. Basic Elements of E-R Model Entity Object of the real world that stores data. Eg. Customer, State, Project, Supplier,
Chapter 61 Chapter 6 Index Structures for Files. Chapter 62 Indexes Indexes are additional auxiliary access structures with typically provide either faster.
Indexing and Hashing (emphasis on B+ trees) By Huy Nguyen Cs157b TR Lee, Sin-Min.
1 © Prentice Hall, 2002 Chapter 3: Modeling Data in the Organization Modern Database Management 6 th Edition Jeffrey A. Hoffer, Mary B. Prescott, Fred.
Indexing. Goals: Store large files Support multiple search keys Support efficient insert, delete, and range queries.
IntroductionIntroduction  Definition of B-trees  Properties  Specialization  Examples  2-3 trees  Insertion of B-tree  Remove items from B-tree.
B+ Tree What is a B+ Tree Searching Insertion Deletion.
©Silberschatz, Korth and Sudarshan12.1Database System Concepts B + -Tree Index Files Indexing mechanisms used to speed up access to desired data.  E.g.,
Announcements Exam Friday Project: Steps –Due today.
CS-1Q IM Revision 21 January Revision CS-1Q IM Lecture 10 Phil Gray Simon Gay.
Copyright (c) 2014 Pearson Education, Inc. Introduction to Databases.
CSE373: Data Structures & Algorithms Lecture 15: B-Trees Linda Shapiro Winter 2015.
B-Trees. CSM B-Trees 2 Motivation for B-Trees So far we have assumed that we can store an entire data structure in main memory What if we have so.
Database Design Using Entity-Relationship Models Transformation of Entity-Relationship Models into Relational Database Design Trees, Networks, and Bills.
The Relational Database Model
Announcements Exam Friday. More Physical Storage Lecture 10.
Information Systems & Databases 2.2) Organisation methods.
1 Relational Databases and SQL. Learning Objectives Understand techniques to model complex accounting phenomena in an E-R diagram Develop E-R diagrams.
Revision Instructor: Mohamed Eltabakh 1.
3 & 4 1 Chapters 3 and 4 Drawing ERDs October 16, 2006 Week 3.
B-Trees. Motivation for B-Trees So far we have assumed that we can store an entire data structure in main memory What if we have so much data that it.
1 Tree Indexing (1) Linear index is poor for insertion/deletion. Tree index can efficiently support all desired operations: –Insert/delete –Multiple search.
 An entity-relationship diagram (ERD) is a specialized graphic that illustrates the interrelationships between entities in a database.
System and data modeling tools Revision. Schemas A schema shows the organisational structure of a database. It should show the entities (the tables in.
Indexing and hashing Azita Keshmiri CS 157B. Basic concept An index for a file in a database system works the same way as the index in text book. For.
Relational Theory and Design
Marwan Al-Namari Hassan Al-Mathami. Indexing What is Indexing? Indexing is a mechanisms. Why we need to use Indexing? We used indexing to speed up access.
INTRODUCTION TO DATABASE DESIGN. Definitions Database Models: Conceptual, Logical, Physical Conceptual: “big picture” overview of data and relationships.
1 6 Concepts of Database Management, 5 th Edition, Pratt & Adamski Chapter 6 Database Design 2: Design Methodology Spring 2006.
Database Systems: Design, Implementation, and Management Ninth Edition
Done By : Gillian Swaby. Objectives: 1. What is an Entity-Relationship Diagram? 2.What are the symbols used in ERD? Explain each. 3. What is a one- to-
Internal and External Sorting External Searching
Chapter 3: Modeling Data in the Organization. Business Rules Statements that define or constrain some aspect of the business Assert business structure.
Week 15 – Wednesday.  What did we talk about last time?  Review up to Exam 1.
Data Modeling and the Entity-Relationship Model CS 475 Lecture Notes.
1 Information System Analysis Topic-3. 2 Entity Relationship Diagram \ Definition An entity-relationship (ER) diagram is a specialized graphic that illustrates.
Moya messam.  Definition: An entity-relationship (ER) diagram is a specialized graphic that illustrates the interrelationships between entities in a.
Department of Mathematics Computer and Information Science1 CS 351: Database Management Systems Christopher I. G. Lanclos Chapter 4.
System Analysis and Design Copyright © Genetic Computer School 2007 SAD9-1 CHAPTER OVERVIEW  Entity Relationship Diagram  Data Model And Its Main Components.
IS 4420 Database Fundamentals Chapter 3: Modeling Data in the Organization Leon Chen.
Lecture 5 Data Model Design Jeffery S. Horsburgh Hydroinformatics Fall 2012 This work was funded by National Science Foundation Grant EPS
Entity Relationship Diagram
Storage Access Paging Buffer Replacement Page Replacement
Translation of ER-diagram into Relational Schema
B-Trees.
Indexing and Hashing Basic Concepts Ordered Indices
Chapter 5 Advanced Data Modeling
Tests of Divisibility 1 - All integers can be divided by 1
Chapter 11 Indexing And Hashing (1)
Lecture 30: Final Review Wednesday, December 6, 2000.
Goals Design decisions Design Insertion
B-Trees.
© 2008 Pearson Prentice Hall, Experiencing MIS, David Kroenke
Presentation transcript:

1 Announcements Project Due Friday 5:00 PM Group Presentations –10 minutes –Describe project (ERD), discuss any challenges, show us some queries Final – Monday, December 9am in KH006 –Optional early exam: Friday, December 1pm in KH006

2 Final Review Lecture 24

3 Approximate Composition of the Exam 70% - Chapters 3-6, and embedded programs (excluding relational algebra) 10% - Special Topics –Not all questions will be worth the same You’ll have to answer enough to add up to the right point value –No answering your own question 10-15% Chapters 2, 8, IR, and relational algebra (Short answers, T/F, fill in the blank, multiple choice) 5-10% Physical Storage

4 Review Physical Storage - Application A disk block is 2048B A record is 450B There are 10,000 records 1.What is the block factor? 2.What is the number of blocks needed to store entire table?

5 Example B+ Tree

6 Rules for Constructing a B+ Tree If the root is not a leaf, it must have at least two children If the tree is order n, each interior node (that is, all nodes except the root and leaf nodes), must have between n/2 and n occupied pointers (and children). If n/2 is not an integer, roundup to determine the minimizes number of pointers

7 Rules for Constructing a B+ Tree The number of key values contained in a non-leaf node is 1 less than the number of pointers If the tree has order n, the number of occupied key values in a leaf node must be between (n-1)/2 and n-1. If (n-1)/2 is not an integer, round up to determine the minimum number of occupied key values. The tree must be balanced, that is, every path from the root node must have the same length.

8 Symbols used in E-R Diagram Entity – rectangle Attribute – oval Relationship – diamond Link - line

9 Scenario – Organization of Olympic Facilities The Olympic facilities are divided into sports complexes. Sports complexes are divided into one-sport and multisport types. Multisport complexes have areas of the complex designed for each sport with a location indicator (e.g. center, NE corner, etc.). A complex has a location, chief organizing individual, total occupied area, and so on. Each complex holds a series of events (e.g., the track stadium may hold many different races). For each event there is a planned date, duration, number of participants, number of officials, and so on. A roster of all officials will be maintained together with the list of events each official will be involved in. The two types of facilities (one-sport and multisport) will have different types of information. For each type, the approximate budget will be kept.

10 Olympic EER Diagram

11 Olympic Relations

12 Functional Dependencies and Normalization

13 Olympic DDL and SQL