Class Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414
|
|
|
- Griselda Paul
- 5 years ago
- Views:
Transcription
1 Introution to Dt Mngement CSE 44 Unit 6: Coneptul Design E/R Digrms Integrity Constrints BCNF Introution to Dt Mngement CSE 44 E/R Digrms ( letures) CSE 44 Autumn 08 Clss Overview Dtse Design Unit : Intro Unit : Reltionl Dt Moels n Query Lnguges Unit : Non-reltionl t Unit 4: RDMBS internls n query optimiztion Unit 5: Prllel query proessing Unit 6: DBMS usility, oneptul esign E/R igrms Shem normliztion Unit 7: Trnstions Unit 8: Avne topis (time permitting) CSE 44 Autumn 08 4 Wht it is: Strting from srth, esign the tse shem: reltion, ttriutes, keys, foreign keys, onstrints et Why it s hr The tse will e in opertion for very long time (yers). Upting the shem while in proution is very expensive (why?) CSE 44 Autumn 08 5 Dtse Design Dtse Design Proess Consier issues suh s: Wht entities to moel How entities re relte Wht onstrints exist in the omin Severl formlisms exists We isuss E/R igrms UML, moel-riven rhiteture Reing: Se CSE 44 Autumn 08 6 Coneptul Moel: Reltionl Moel: Tles + onstrints An lso funtionl ep. Normliztion: Elimintes nomlies Coneptul Shem Physil storge etils Physil Shem prout ompny 7
2 Entity / Reltionship Digrms Entity set = lss An entity = n ojet CEO Attriute ity Reltionship uys employs CSE 44 Autumn 08 8 ssn 9 Keys in E/R Digrms Wht is Reltion? Every entity set must hve key CSE 44 Autumn 08 0 A mthemtil efinition: if A, B re sets, then reltion R is suset of A B A={,,}, B={,,,}, A B = {(,),(,),..., (,)} R = {(,), (,), (,)} A= B= is suset of : CSE 44 Autumn 08 Multipliity of E/R Reltions Multipliity of E/R Reltions one-one: one-one: mny-one CSE 44 Autumn 08 CSE 44 Autumn 08
3 Multipliity of E/R Reltions one-one: mny-one mny-mny CSE 44 Autumn 08 4 uys Wht oes this sy? CEO employs ssn 5 Attriutes on Reltionships Wht oes this sy? Multi-wy Reltionships How o we moel purhse reltionship etween uyers, prouts n stores? te te Purhse Buys Cn still moel s mthemtil set (How?) CSE 44 Autumn 08 6 As set of triples 7 Arrows in Multiwy Reltionships Q: Wht oes the rrow men? te Purhse Arrows in Multiwy Reltionships Q: Wht oes the rrow men? te Purhse A: Any person uys given prout from t most one store [Fine print: Arrow pointing to E mens tht if we selet one entity from eh of the other entity sets in the reltionship, those entities re relte to t most one entity in E] CSE 44 Autumn 08 8 A: Any person uys given prout from t most one store AND every store sells to every person t most one prout CSE 44 Autumn 08 9
4 Converting Multi-wy Reltionships to Binry Converting Multi-wy Reltionships to Binry te Of te Of Purhse Of Purhse Of BuyerOf BuyerOf Arrows go in whih iretion? 0 Mke sure you unerstn why! Wht s wrong?. Design Priniples Design Priniples: Wht s Wrong? Purhse te Purhse Country Presient Morl: Be fithful to the speifitions of the pplition! personar personnme Morl: pik the right kin of entities. CSE 44 Autumn 08 CSE 44 Autumn 08 Design Priniples: Wht s Wrong? From E/R Digrms to Reltionl Shem Dtes te Entity set à reltion Reltionship à reltion Purhse Morl: on t omplite life more thn it lrey is. 4 CSE 44 Autumn
5 Entity Set to Reltion N-N Reltionships to Reltions pro-id tegory te pro-id ust-id te (pro-id, tegory, ) pro-id tegory Gizmo55 Cmer Pokemn9 Toy Orers Shipment Shipping-Co Represent this in reltions CSE 44 Autumn 08 7 N-N Reltionships to Reltions N- Reltionships to Reltions te pro-id ust-id te te pro-id ust-id te Orers Shipment Shipping-Co Orers Shipment Shipping-Co Orers(pro-ID,ust-ID, te) Shipment(pro-ID,ust-ID,, te) Shipping-Co(, ) pro-id ust-id te Gizmo55 Joe UPS 4/0/0 Gizmo55 Joe FEDEX 4/9/0 Represent this in reltions CSE 44 Autumn 08 9 N- Reltionships to Reltions Moeling Sulsses te pro-id Orers ust-id Shipment te Shipping-Co Nme Prie Ctegory Pltforms Age-group Gizmo 99 gget unix NULL Cmer 49 photo NULL NULL Toy 9 gget NULL infnt Orers(pro-ID,ust-ID, te,, te) Shipping-Co(, ) Rememer: no seprte reltions for mny-one reltionship 0 Softwre prouts s Eutionl prouts CSE 44 Autumn 08 5
6 Moeling Sulsses Nme Prie Ctegory Pltforms Age-group Gizmo 99 gget unix NULL Cmer 49 photo NULL NULL Toy 9 gget NULL infnt Moeling Sulsses Nme Prie Ctegory Cmer 49 photo Softwre Nme Prie Ctegory Pltforms Gizmo 99 gget unix Softwre prouts s Eutionl prouts Eutionl Nme Prie Ctegory Age-group Toy 9 gget infnt CSE 44 Autumn 08 CSE 44 Autumn 08 4 Moeling Sulsses Sulsses tegory Some ojets in lss my e speil efine new lss etter: efine sulss s Softwre prouts Eutionl prouts is is So --- we efine sulsses in E/R Softwre Eutionl CSE 44 Autumn 08 5 pltforms CSE 44 Autumn 08 Age 6Group Sulsses to Reltions is Softwre pltforms tegory is Eutionl Other wys to onvert re possile Sw. Age Group Nme Prie Ctegory Gizmo 99 gget Cmer 49 photo Toy 9 gget Nme Gizmo E. Nme Gizmo pltforms unix Age Group toler Toy retire CSE 44 Autumn 08 7 Moeling Union Types with Sulsses FurniturePiee Sy: eh piee of furniture is owne either y person or y ompny CSE 44 Autumn
7 Moeling Union Types with Sulsses Moeling Union Types with Sulsses Sy: eh piee of furniture is owne either y person or y ompny Solution. Aeptle ut imperfet (Wht s wrong?) FurniturePiee Solution : etter, more lorious is Owner is owneby owneby ownebycomp. FurniturePiee CSE 44 Autumn 08 9 CSE 44 Autumn Wek Entity Sets Entity sets re wek when their key omes from other lsses to whih they re relte. Tem ffilition University Introution to Dt Mngement CSE 44 sport numer Integrity Constrints Tem(sport, numer, universitynme) University() CSE 44 Autumn 08 4 CSE 44 Autumn 08 4 Integrity Constrints Motivtion An integrity onstrint is onition speifie on tse shem tht restrits the t tht n e store in n instne of the tse. Constrints in E/R Digrms Fining onstrints is prt of the moeling proess. Commonly use onstrints: Keys: soil seurity numer uniquely ientifies person. ICs help prevent entry of inorret informtion How? DBMS enfores integrity onstrints Allows only legl tse instnes (i.e., those tht stisfy ll onstrints) to exist Ensures tht ll neessry heks re lwys performe n vois upliting the verifition logi in eh pplition Single-vlue onstrints: person n hve only one fther. Referentil integrity onstrints: if you work for ompny, it must exist in the tse. Other onstrints: peoples ges re etween 0 n 50. CSE 44 Autumn CSE 44 Autumn
8 Keys in E/R Digrms Single Vlue Constrints Unerline: tegory No forml wy to speify multiple keys in E/R igrms vs. CSE 44 Autumn 08 ssn 46 CSE 44 Autumn Referentil Integrity Constrints Eh prout me y t most one ompny. Some prouts me y no ompny Eh prout me y extly one ompny. CSE 44 Autumn
Introduction to Database Systems CSE 414. Lecture 19: E/R Diagrams
Introduction to Database Systems CSE 414 Lecture 19: E/R Diagrams CSE 414 - Spring 2018 1 Class Overview Unit 1: Intro Unit 2: Relational Data Models and Query Languages Unit 3: Non-relational data Unit
Introduction to Data Management CSE 344
Introduction to Data Management CSE 344 Lecture 15: E/R Diagrams Guest Lecturer: Sudeepa Roy CSE 344 - Fall 2013 1 Announcements WQ6 due Thursday (there is no WQ5 ) Homework 4 posted, due Friday Midterm:
Announcements. Database Design. Database Design. Database Design Process. Entity / Relationship Diagrams. Introduction to Data Management CSE 344
Announcements Introduction to Data Management CSE 344 HW5 due this Friday Please note minor up to the instructions WQ6 due next Wednesday Lecture 17: E/R Diagrams and Constraints 1 2 Database Design What
CSE 344 MAY 11 TH ENTITIES
CSE 344 MAY 11 TH ENTITIES ADMINISTRIVIA HW6 Due next Wednesday (May 16) Section 7 slides very helpful HW7 Out Wednesday Due May 23 rd HW8 Out May 23 rd Due last day of class, Jun 1 Exam Graded and on
Introduction to Data Management CSE 344
Introduction to Data Management CSE 344 Lecture 17: E/R Diagrams and Constraints CSE 344 - Winter 2016 1 Announcements HW5 due this Friday Please note minor update to the instructions WQ6 due next Wednesday
Introduction to Database Systems CSE 414
Introduction to Database Systems CSE 414 Lecture 17: E/R Diagrams CSE 414 - Spring 2013 1 Announcements HW5 (XML) due Wednesday New webquiz coming by mid-week Today: E/R diagrams (4.1-4.6) CSE 414 - Spring
Database Design Process Entity / Relationship Diagrams
Announcements Database Systems CSE 414 Lecture 22: E/R Diagrams (4.1-6) and Constraints (7.1-2) HW7 will be posted on Tuesday and due on Dec. 1 st 11pm WQ6 will be posted on Tuesday and due on Nov. 30th
CSE 344 JULY 30 TH DB DESIGN (CH 4)
CSE 344 JULY 30 TH DB DESIGN (CH 4) ADMINISTRIVIA HW6 due next Thursday uses Spark API rather than MapReduce (a bit higher level) be sure to shut down your AWS cluster when not in use Still grading midterms...
Introduction to Data Management CSE 344
Introduction to Data Management CSE 344 Lecture 17: E/R Diagrams and Constraints CSE 344 - Fall 2015 1 Database Design Why do we need it? Need a way to model real world entities in terms of relations Not
Announcements. Database Design. Database Design. Database Design Process. Entity / Relationship Diagrams. Database Systems CSE 414
Announcements Database Systems CSE 414 HW5 due on Thursday (was Tuesday before) WQ6 due on Sunday Lecture 17: E/R Diagrams (4.1-6) and Constraints (7.1-2) 1 2 Database Design What it is: Starting from
Database Systems CSE 414
Database Systems CSE 414 Lecture 17: E/R Diagrams (4.1-6) and Constraints (7.1-2) CSE 414 - Spring 2017 1 Announcements HW5 due on Thursday (was Tuesday before) WQ6 due on Sunday CSE 414 - Spring 2017
Database Systems CSE 414
Database Systems CSE 414 Lecture 22: E/R Diagrams (4.1-6) and Constraints (7.1-2) CSE 414 - Fall 2017 1 Announcements HW7 will be posted on Tuesday and due on Dec. 1 st 11pm WQ6 will be posted on Tuesday
CMPUT101 Introduction to Computing - Summer 2002
CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,
Rolling Back Remote Provisioning Changes. Dell Command Integration for System Center
Rolling Bk Remote Provisioning Chnges Dell Commn Integrtion for System Center Notes, utions, n wrnings NOTE: A NOTE inites importnt informtion tht helps you mke etter use of your prout. CAUTION: A CAUTION
UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS
UTMC APPLICATION NOTE UT1553B BCRT TO 80186 INTERFACE INTRODUCTION The UTMC UT1553B BCRT is monolithi CMOS integrte iruit tht provies omprehensive Bus Controller n Remote Terminl funtions for MIL-STD-
COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA:
In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following
CSE 344 MAY 14 TH ENTITIES
CSE 344 MAY 14 TH ENTITIES EXAMS Scores Final grades Concerned? Email about meeting Final Exam 35% of grade ADMINISTRIVIA HW6 Due Wednesday OQ6 Out Wednesday HW7 Out Wednesday E/R + Normalization DATABASE
V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)
Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from
Type Checking. Roadmap (Where are we?) Last lecture Context-sensitive analysis. This lecture Type checking. Symbol tables
Type Cheking Rodmp (Where re we?) Lst leture Contet-sensitie nlysis Motition Attriute grmmrs Ad ho Synt-direted trnsltion This leture Type heking Type systems Using synt direted trnsltion Symol tles Leil
10.2 Graph Terminology and Special Types of Graphs
10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the
Greedy Algorithm. Algorithm Fall Semester
Greey Algorithm Algorithm 0 Fll Semester Optimiztion prolems An optimiztion prolem is one in whih you wnt to fin, not just solution, ut the est solution A greey lgorithm sometimes works well for optimiztion
Error Numbers of the Standard Function Block
A.2.2 Numers of the Stndrd Funtion Blok evlution The result of the logi opertion RLO is set if n error ours while the stndrd funtion lok is eing proessed. This llows you to rnh to your own error evlution
Generating Editors for Direct Manipulation of Diagrams
Generting Eitors for Diret Mnipultion of Digrms Gerhr Viehstet n Mrk Mins Lehrstuhl für Progrmmiersprhen Universität Erlngen-Nürnerg Mrtensstr. 3, 91058 Erlngen, Germny E-mil: fviehste,minsg@informtik.uni-erlngen.e
Distributed Systems Principles and Paradigms
Distriuted Systems Priniples nd Prdigms Christoph Dorn Distriuted Systems Group, Vienn University of Tehnology.dorn@infosys.tuwien..t http://www.infosys.tuwien..t/stff/dorn Slides dpted from Mrten vn Steen,
CICS Application Design
CICS Applition Design In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the
Lecture 8: Graph-theoretic problems (again)
COMP36111: Advned Algorithms I Leture 8: Grph-theoreti prolems (gin) In Prtt-Hrtmnn Room KB2.38: emil: iprtt@s.mn..uk 2017 18 Reding for this leture: Sipser: Chpter 7. A grph is pir G = (V, E), where V
Introduction to Data Management CSE 344
Introduction to Data Management CSE 344 Lectures 18: Design Theory CSE 344 - Winter 2017 1 Database Design Process Lec 16 Conceptual Model: name product makes company Relational Model: Tables + constraints
XML and Databases. Outline. XPath. Outline - Lectures. XPath Data Model. Outline - Assignments. XPath. Sebastian Maneth NICTA and UNSW
Outline XML n Dtses Leture 6 Noe Seleting Queries: XPth 1.0 1. XPth Dt Moel: 7 types of noes 2. Simple Exmples 3. Lotion Steps n Pths 4. Vlue Comprison, n Other Funtions Sestin Mneth NICTA n UNSW CSE@UNSW
CS 241 Week 4 Tutorial Solutions
CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it
Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems
Distriuted Systems Priniples nd Prdigms Mrten vn Steen VU Amsterdm, Dept. Computer Siene steen@s.vu.nl Chpter 11: Distriuted File Systems Version: Deemer 10, 2012 2 / 14 Distriuted File Systems Distriuted
Introduction to Algebra
INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh
MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam
Cmrige, Msshusetts Introution to Mtrois n Applitions Srikumr Rmlingm MERL mm//yy Liner Alger (,0,0) (0,,0) Liner inepenene in vetors: v, v2,..., For ll non-trivil we hve s v s v n s, s2,..., s n 2v2...
1.1. Interval Notation and Set Notation Essential Question When is it convenient to use set-builder notation to represent a set of numbers?
1.1 TEXAS ESSENTIAL KNOWLEDGE AND SKILLS Prepring for 2A.6.K, 2A.7.I Intervl Nottion nd Set Nottion Essentil Question When is it convenient to use set-uilder nottion to represent set of numers? A collection
Unit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
CS 340, Fall 2016 Sep 29th Exam 1 Note: in all questions, the special symbol ɛ (epsilon) is used to indicate the empty string.
CS 340, Fll 2016 Sep 29th Exm 1 Nme: Note: in ll questions, the speil symol ɛ (epsilon) is used to indite the empty string. Question 1. [10 points] Speify regulr expression tht genertes the lnguge over
If you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.
Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online
Section 2.3 Functions. Definition: Let A and B be sets. A function (mapping, map) f from A to B, denoted f :A B, is a subset of A B such that
Setion 2.3 Funtions Definition: Let n e sets. funtion (mpping, mp) f from to, enote f :, is suset of suh tht x[x y[y < x, y > f ]] n [< x, y 1 > f < x, y 2 > f ] y 1 = y 2 Note: f ssoites with eh x in
Lecture 4. Lecture 4: The E/R Model
Lecture 4 Lecture 4: The E/R Model Lecture 4 Today s Lecture 1. E/R Basics: Entities & Relations ACTIVITY: Crayon time! 2. E/R Design considerations ACTIVITY: Crayon time pt. II 3. Advanced E/R Concepts
Entity/Relationship Modelling
Entity/Relationship Modelling Lecture 4 1 Outline E/R model (Chapter 5) From E/R diagrams to relational schemas (Chapter 5) Constraints in SQL (Chapter 4) 2 1. Database Design Modelling Decide which part
COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator.
COMMON FRACTIONS BASIC DEFINITIONS * A frtion is n inite ivision. or / * In the frtion is lle the numertor n is lle the enomintor. * The whole is seprte into "" equl prts n we re onsiering "" of those
WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS
WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS WS19-1 WS19-2 Prolem Desription This exerise is use to emonstrte how to mp isplement results from the nlysis of glol(overll) moel onto the perimeter of
Pipeline Example: Cycle 1. Pipeline Example: Cycle 2. Pipeline Example: Cycle 4. Pipeline Example: Cycle 3. 3 instructions. 3 instructions.
ipeline Exmple: Cycle 1 ipeline Exmple: Cycle X X/ /W X X/ /W $3,$,$1 lw $,0($5) $3,$,$1 3 instructions 8 9 ipeline Exmple: Cycle 3 ipeline Exmple: Cycle X X/ /W X X/ /W sw $6,($7) lw $,0($5) $3,$,$1 sw
A23 ECR SEP2017 WW RR A24 ECR MAY2018 KD FL N#0.30
THIS RWING IS UNPULISHE. OPYRIGHT 0 Y RELESE FOR PULITION LL RIGHTS RESERVE. 0 LO IST ES 00 P LTR ESRIPTION TE WN PV ER0 SEP0 WW RR ER00 0MY0 K FL N#0.0 M#0.0 NOTE HOUSING HS RST OMPLINT KEYING, LTHING,
Software Configuration Management
Softwre Configurtion Mngement Leture: Introdution SCM Chpters: 1, 2 nd 3 René Krikhr Niels Veermn Leture Objetives Lern bout SCM nd history of SCM Lern the reltion between SCM nd Softwre development proess
6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.
6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted
WORKSHOP 6 FRAME SURFACE MODEL ANALYSIS
WORKSHOP 6 FRAME SURFACE MODEL ANALYSIS WS6-1 WS6-2 Workshop Ojetives Crete finite element moel (meshes; onnet jent elements; pply e los, operting los, n grvity los; onstrin noes) for intermeitely iffiult
Graph theory Route problems
Bhelors thesis Grph theory Route prolems Author: Aolphe Nikwigize Dte: 986 - -5 Sujet: Mthemtis Level: First level (Bhelor) Course oe: MAE Astrt In this thesis we will review some route prolems whih re
Here is an example where angles with a common arm and vertex overlap. Name all the obtuse angles adjacent to
djcent tht do not overlp shre n rm from the sme vertex point re clled djcent ngles. me the djcent cute ngles in this digrm rm is shred y + + me vertex point for + + + is djcent to + djcent simply mens
Architecture and Data Flows Reference Guide
Arhiteture nd Dt Flows Referene Guide BlkBerry UEM Version 12.7 Pulished: 2017-07-12 SWD-20170627140413745 Contents Aout this guide... 5 Arhiteture: BlkBerry UEM solution... 6 BlkBerry UEM omponents...
Outline. CS38 Introduction to Algorithms. Graphs. Graphs. Graphs. Graph traversals
Outline CS38 Introution to Algorithms Leture 2 April 3, 2014 grph trversls (BFS, DFS) onnetivity topologil sort strongly onnete omponents heps n hepsort greey lgorithms April 3, 2014 CS38 Leture 2 2 Grphs
UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS 1 COMPUTATION & LOGIC INSTRUCTIONS TO CANDIDATES
UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS COMPUTATION & LOGIC Sturdy st April 7 : to : INSTRUCTIONS TO CANDIDATES This is tke-home exercise. It will not
Dr. D.M. Akbar Hussain
Dr. D.M. Akr Hussin Lexicl Anlysis. Bsic Ide: Red the source code nd generte tokens, it is similr wht humns will do to red in; just tking on the input nd reking it down in pieces. Ech token is sequence
The Entity-Relationship Model (ER Model) - Part 2
Lecture 4 The Entity-Relationship Model (ER Model) - Part 2 By Michael Hahsler Based on slides for CS145 Introduction to Databases (Stanford) Lecture 4 > Section 2 What you will learn about in this section
WORKSHOP 3 FRAME MODEL CREATION USING CURVES, AND ANALYSIS
WORKSHOP 3 FRAME MODEL CREATION USING CURVES, AND ANALYSIS WS3-1 WS3-2 Workshop Ojetives Moel simple frme struture using geometri urves n 1D Br elements. The frme moel is to e onstrine using pin restrints,
Lesson 4.4. Euler Circuits and Paths. Explore This
Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different
COMPUTER EDUCATION TECHNIQUES, INC. (XML ) SA:
In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following
s1 s2 d B (F/D.IR.RS1 == D/X.IR.RD) (F/D.IR.RS2 == D/X.IR.RD) (F/D.IR.RS1 == X/M.IR.RD) (F/D.IR.RS2 == X/M.IR.RD) = 1 = 1
Hrwre Interlock Exmple: cycle Hrwre Interlock Exmple: cycle ile s s / / / t em / ile s s / / / t em / nop nop hzr hzr $,$,$ $,$,$ (/..R == /..R) (/..R == /..R) (/..R == /..R) (/..R == /..R) = (/..R ==
Lecture 5. Lecture 5: The E/R Model
Lecture 5 Lecture 5: The E/R Model Lecture 2 Announcements! 1. PS1 due at midnight! Please go over Piazza for hints. We will post solutions tomorrow. Grades coming soon! 2. Project part 1 out today! 3.
Can Pythagoras Swim?
Overview Ativity ID: 8939 Mth Conepts Mterils Students will investigte reltionships etween sides of right tringles to understnd the Pythgoren theorem nd then use it to solve prolems. Students will simplify
A decision support system prototype for fuzzy multiple objective optimization
EUSFLAT - LFA A eision support system prototype for fuzzy multiple ojetive optimiztion Fengjie Wu Jie Lu n Gungqun Zhng Fulty of Informtion Tehnology University of Tehnology Syney Austrli E-mil: {fengjiewjieluzhngg}@it.uts.eu.u
WORKSHOP 8B TENSION COUPON
WORKSHOP 8B TENSION COUPON WS8B-2 Workshop Ojetives Prtie reting n eiting geometry Prtie mesh seeing n iso meshing tehniques. WS8B-3 Suggeste Exerise Steps 1. Crete new tse. 2. Crete geometry moel of the
A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $
Informtion Systems 29 (2004) 23 46 A mthing lgorithm for mesuring the struturl similrity etween n XML oument n DTD n its pplitions $ Elis Bertino, Giovnn Guerrini, Mro Mesiti, * Diprtimento i Informti
WORKSHOP 2 CANTILEVERED PLATE
WORKSHOP 2 CANTILEVERED PLATE WS2-1 WS2-2 Prolem Desription This is simple exerise tht involves the simultion of the eformtion of ntilevere plte ue to the pplition of n en lo. The exerise involves 1) retion
Right Angled Trigonometry. Objective: To know and be able to use trigonometric ratios in rightangled
C2 Right Angled Trigonometry Ojetive: To know nd e le to use trigonometri rtios in rightngled tringles opposite C Definition Trigonometry ws developed s method of mesuring ngles without ngulr units suh
An Expressive Hybrid Model for the Composition of Cardinal Directions
An Expressive Hyrid Model for the Composition of Crdinl Directions Ah Lin Kor nd Brndon Bennett School of Computing, University of Leeds, Leeds LS2 9JT, UK e-mil:{lin,brndon}@comp.leeds.c.uk Astrct In
George Boole. IT 3123 Hardware and Software Concepts. Switching Algebra. Boolean Functions. Boolean Functions. Truth Tables
George Boole IT 3123 Hrdwre nd Softwre Concepts My 28 Digitl Logic The Little Mn Computer 1815 1864 British mthemticin nd philosopher Mny contriutions to mthemtics. Boolen lger: n lger over finite sets
Distance vector protocol
istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers
CSE 344 AUGUST 1 ST ENTITIES
CSE 344 AUGUST 1 ST ENTITIES EXAMS Will hand back after class Quartiles 1 0 67 2 68 74 3 74 82 4 82 100 (no one actually got 0 or 100) ADMINISTRIVIA HW6 due Wednesday Spark SQL interface much easier to
Introduction. Example
OMS0 Introution isjoint sets n minimum spnning trees In this leture we will strt by isussing t struture use for mintining isjoint subsets of some bigger set. This hs number of pplitions, inluing to mintining
Systems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits
Systems I Logic Design I Topics Digitl logic Logic gtes Simple comintionl logic circuits Simple C sttement.. C = + ; Wht pieces of hrdwre do you think you might need? Storge - for vlues,, C Computtion
Unit 5 Vocabulary. A function is a special relationship where each input has a single output.
MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with
Chapter 4 Fuzzy Graph and Relation
Chpter 4 Fuzzy Grph nd Reltion Grph nd Fuzzy Grph! Grph n G = (V, E) n V : Set of verties(node or element) n E : Set of edges An edge is pir (x, y) of verties in V.! Fuzzy Grph ~ n ( ~ G = V, E) n V :
6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page.
6045J/18400J: Automt, Computbility nd Complexity Mrh 30, 2005 Quiz 2: Solutions Prof Nny Lynh Vinod Vikuntnthn Plese write your nme in the upper orner of eh pge Problem Sore 1 2 3 4 5 6 Totl Q2-1 Problem
5 ANGLES AND POLYGONS
5 GLES POLYGOS urling rige looks like onventionl rige when it is extene. However, it urls up to form n otgon to llow ots through. This Rolling rige is in Pington sin in Lonon, n urls up every Friy t miy.
Preserving Constraints for Aggregation Relationship Type Update in XML Document
Preserving Constrints for Aggregtion Reltionship Type Updte in XML Document Eric Prdede 1, J. Wenny Rhyu 1, nd Dvid Tnir 2 1 Deprtment of Computer Science nd Computer Engineering, L Trobe University, Bundoor
Parallelization Optimization of System-Level Specification
Prlleliztion Optimiztion of System-Level Speifition Luki i niel. Gjski enter for Emedded omputer Systems University of liforni Irvine, 92697, US {li, gjski} @es.ui.edu strt This pper introdues the prlleliztion
Midterm Exam CSC October 2001
Midterm Exm CSC 173 23 Otoer 2001 Diretions This exm hs 8 questions, severl of whih hve suprts. Eh question indites its point vlue. The totl is 100 points. Questions 5() nd 6() re optionl; they re not
Table-driven look-ahead lexical analysis
Tle-riven look-he lexil nlysis WUU YANG Computer n Informtion Siene Deprtment Ntionl Chio-Tung University, HsinChu, Tiwn, R.O.C. Astrt. Moern progrmming lnguges use regulr expressions to efine vli tokens.
Solids. Solids. Curriculum Ready.
Curriulum Rey www.mthletis.om This ooklet is ll out ientifying, rwing n mesuring solis n prisms. SOM CUES The Som Cue ws invente y Dnish sientist who went y the nme of Piet Hein. It is simple 3 # 3 #
WORKSHOP 8A TENSION COUPON
WORKSHOP 8A TENSION COUPON WS8A-2 Workshop Ojetives Buil the tension oupon geometry Control the mesh y using tehniques isusse in lss Compre FEA stress results to theoretil results From Stress Conentrtion
ES 00 NTS 1 5 A7 RAST 2.5 TAB HEADER ASSY TH, VERTICAL, EXTERNAL LOCKING
2 THIS RWING IS UNPULISHE. OPYRIGHT 2 Y RELESE FOR PULITION LL RIGHTS RESERVE. 2 LO IST ES P LTR ESRIPTION TE WN PV ER2 JUN2 M.T YH.M.2 2. ER NOV2 GRZ T ER MY2 WW RR NOTE SEE SHEET FOR VILLE ONFIGURTIONS
Bayesian Networks: Directed Markov Properties (Cont d) and Markov Equivalent DAGs
Byesin Networks: Direte Mrkov Properties (Cont ) n Mrkov Equivlent DAGs Huizhen Yu jney.yu@s.helsinki.fi Dept. Computer Siene, Univ. of Helsinki Proilisti Moels, Spring, 2010 Huizhen Yu (U.H.) Byesin Networks:
1 Which of the following keyword can not be appeared inside the class? a)virtual b)static c)template d)friend c
1 Whih of the following keywor n not e ppere insie the lss? )virtul )stti )templte )frien 2 Wht is templte? )Templte is formul for reting generi lss )Templte is use to mnipulte lss )Templte is use for
Calculus Differentiation
//007 Clulus Differentition Jeffrey Seguritn person in rowot miles from the nerest point on strit shoreline wishes to reh house 6 miles frther down the shore. The person n row t rte of mi/hr nd wlk t rte
UNIT 11. Query Optimization
UNIT Query Optimiztion Contents Introduction to Query Optimiztion 2 The Optimiztion Process: An Overview 3 Optimiztion in System R 4 Optimiztion in INGRES 5 Implementing the Join Opertors Wei-Png Yng,
Doubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral
Douts out how to use zimuth vlues from Coordinte Ojet Jun Antonio Breñ Morl # Definition An Azimuth is the ngle from referene vetor in referene plne to seond vetor in the sme plne, pointing towrd, (ut
COMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
INTEGRATED WORKFLOW ART DIRECTOR
ART DIRECTOR Progrm Resoures INTEGRATED WORKFLOW PROGRAM PLANNING PHASE In this workflow phse proess, you ollorte with the Progrm Mnger, the Projet Mnger, nd the Art Speilist/ Imge Led to updte the resoures
Introduction to hardware design using VHDL
Introuction to hrwre esign using VHDL Tim Güneysu n Nele Mentens ECC school Novemer 11, 2017, Nijmegen Outline Implementtion pltforms Introuction to VHDL Hrwre tutoril 1 Implementtion pltforms Microprocessor
CS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal
CS 55 Computer Grphis Hidden Surfe Removl Hidden Surfe Elimintion Ojet preision lgorithms: determine whih ojets re in front of others Uses the Pinter s lgorithm drw visile surfes from k (frthest) to front
Definition of Regular Expression
Definition of Regulr Expression After the definition of the string nd lnguges, we re redy to descrie regulr expressions, the nottion we shll use to define the clss of lnguges known s regulr sets. Recll
Final Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book
inl xm Review 06 M 236 e sure to loo over ll of your tests, s well s over the tivities you did in the tivity oo 1 1. ind the mesures of the numered ngles nd justify your wor. Line j is prllel to line.
Reducing Costs with Duck Typing. Structural
Reducing Costs with Duck Typing Structurl 1 Duck Typing In computer progrmming with object-oriented progrmming lnguges, duck typing is lyer of progrmming lnguge nd design rules on top of typing. Typing
Duality in linear interval equations
Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny
Lecture 12 : Topological Spaces
Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X
Architecture and Data Flows Reference Guide
Arhiteture nd Dt Flows Referene Guide BES12 Version 12.5 Pulished: 2016-06-29 SWD-20160620150844487 Contents Aout this guide... 5 Arhiteture: BES12 EMM solution... 6 BES12 omponents...8 Components used
3. Advanced E/R Concepts
3. Advanced E/R Concepts 75 What you will learn about in this section Subclasses & connection to OO Constraints Weak entity sets 76 Modeling Subclasses Some objects in a class may be special, i.e. worthy
Introducing fractions
Introduing frtions Nme Colour hlf of eh shpe: Show the following fr ons: out of out of out of Lel these fr ons: Shde these fr ons: 7 0 Represents ommon fr ons on different models Interprets the numertor
this grammar generates the following language: Because this symbol will also be used in a later step, it receives the
LR() nlysis Drwcks of LR(). Look-hed symols s eplined efore, concerning LR(), it is possile to consult the net set to determine, in the reduction sttes, for which symols it would e possile to perform reductions.
Privacy Statement Makelaars Associatie Nederland bv, Makelaars Associatie Verhuur bv, and Makelaars Associatie Vastgoedmanagement bv
Privy sttement 24 oktoer 2018 Privy Sttement Mkelrs Assoitie Nederlnd v, Mkelrs Assoitie Verhuur v, nd Mkelrs Assoitie Vstgoedmngement v You re deling with Mkelrs Assoitie Nederlnd v, Mkelrs Assoitie Verhuur