Relational Model. Lecture #6 Autumn, Fall, 2001, LRX
|
|
- Alison Benson
- 5 years ago
- Views:
Transcription
1 Reationa Mode Lecture #6 Autumn, 2001 #06 Reationa Mode HUST,Wuhan,China 121
2 Reationa Mode Tabe = reation. Coumn headers = attributes. Row = tupe Reation schema = name(attributes). Exampe: Beers(name, manf).» Order of attributes is arbitrary, but in practice we need to assume the order given in the reation schema.» Reation instance is current set of rows for a reation schema. Database schema = coection of reation schemas. #06 Reationa Mode HUST,Wuhan,China 122
3 Reationa Mode (II) #06 Reationa Mode HUST,Wuhan,China 123
4 Keys in Reations An attribute or set of attributes K is a key for a reation R if we expect that in no instance of R wi two different tupes agree on a the attributes of K. Indicate a key by underining the key attributes.» Exampe: If name is a key for Beers: Beers(name, manf) #06 Reationa Mode HUST,Wuhan,China 124
5 Why Reations? Very simpe mode. Often a good match for the way we think about our data. Abstract mode that underies SQL, the most important anguage in DBMS's today.» And even infuentia in competitors ike OQL. #06 Reationa Mode HUST,Wuhan,China 125
6 Abstract Vs. Concrete Reations The reationa mode impemented in SQL differs sighty from the abstract notion of reations that we sha earn first. Big difference: abstract reations are sets of tupes; SQL reations are bags of tupes (i.e., dupicates aowed). Abstract reations vita for foundation:» Semantics of SQL statements.» Forma meaning of functiona dependencies, normaization. #06 Reationa Mode HUST,Wuhan,China 126
7 Reationa Design Reations are coser to rea storage structures than the concepts of E/R or ODL.» Thus, going from E/R or ODL designs to reationa often requires some additiona inteectua input. Easiest Case: Entity Set -> Reation» E. S. attributes become reationa attributes. #06 Reationa Mode HUST,Wuhan,China 127
8 Reationa Design (II) #06 Reationa Mode HUST,Wuhan,China 128
9 Sighty Harder: ODL Cass Without Reationships Probem: ODL aows attribute types buid from structures and coection types. Structure: Make one attribute for each fied. Set: make one tupe for each member of the set.» More than one set attribute? Make tupes for a combinations. Probem: ODL cass may have no key, but we shoud have one in the reation to represent OID." #06 Reationa Mode HUST,Wuhan,China 129
10 Exampe interface Drinkers (key name) { attribute string name; attribute Struct Addr { string street, string city, int zip} address; attribute Set<string> phone; } #06 Reationa Mode HUST,Wuhan,China 130
11 Exampe (II) name street city zip phone n1 s1 c1 z1 p1 n1 s1 c1 z1 p2 #06 Reationa Mode HUST,Wuhan,China 131
12 Exampe (III) Surprise: the key for the cass (name) is not the key for the reation (name, phone).» name in the cass determines a unique object, incuding a unique set of phones.» name in the reation does not determine a unique tupe.» Since tupes are not identica to objects, there is no inconsistency! #06 Reationa Mode HUST,Wuhan,China 132
13 Decompose Reations? One option is to get phone into a separate reation (with name). The database woud ook ike: #06 Reationa Mode HUST,Wuhan,China 133
14 Decompose Reations? (II) #06 Reationa Mode HUST,Wuhan,China 134
15 Decompose Reations? (II) Advantages:»1. Avoids redundancy in address components.»2. Handes the case where someone has no phone. Disadvantage:»Harder to answer queries that jump between two reations, e.g., in what city is phone ? #06 Reationa Mode HUST,Wuhan,China 135
16 A Design Probem interface Famiy { attribute Set<string> parents; attribute Set<string> chidren; } 1. What is the key? 2. How shoud we represent a famiy with two parents and three chidren? 3. Woud you favor decomposition into severa reations? #06 Reationa Mode HUST,Wuhan,China 136
17 E/R Reationships -> Reations Reation has attribute for key attributes of each E.S. that participates in the reationship. Key of reation excudes attributes from the one side if reationship is many-one. For a one-one reationship, choose which side provides the key of the reation. Renaming attributes OK.» Essentia if mutipe roes for an E.S. #06 Reationa Mode HUST,Wuhan,China 137
18 E/R Reationships -> Reations (II) #06 Reationa Mode HUST,Wuhan,China 138
19 E/R Reationships -> Reations (III) Likes(drinker, beer) Favorite(drinker, beer) Married(husband, wife) Buddies(name1, name2) For one-one reation Married, we can choose either husband or wife as key. #06 Reationa Mode HUST,Wuhan,China 139
20 Weak Entity Sets, Reationships -> Reations Hosts(hostName) Logins(oginName, hostname) At(oginName, hostname, hostname2) In At, hostname and hostname2 must be the same host, so deete one of them. Then, Logins and At become the same reation; deete one of them. In this case, Hosts' schema is a subset of Logins' schema. Deete Hosts? Genera rue: Deete the reation that comes from a manyone reationship supporting a weak entity set. #06 Reationa Mode HUST,Wuhan,China 140
21 ODL Reationships Pick one direction, say A -> B. Put key of B attributes in the reation for cass A. Prefer to make A the many," if reationship is many-one. If reationship is many-many, we' have to dupicate A-tupes as in E/R. #06 Reationa Mode HUST,Wuhan,China 141
22 Exampe interface Drinkers { attribute string name; attribute string addr; reationship Set<Beers> ikes inverse Beers::fans; reationship Beers favorite inverse Beers::reaFans; reationship Drinkers husband inverse wife; reationship Drinkers wife inverse husband; reationship Set<Drinkers> buddies inverse buddies; } #06 Reationa Mode HUST,Wuhan,China 142
23 Exampe (II) Drinkers(name, addr, wifename, buddyname, beername, favoritebeer) #06 Reationa Mode HUST,Wuhan,China 143
24 Subcasses -> Reations Three approaches:» 1. ODL stye: each object is in one cass. Create a reation for each cass, with a the attributes for that cass. Don't forget inherited attributes.» 2. E/R stye: an entity is in a network of casses reated by isa. Create one reation for each E.S.; entities represented in a E.S. to which it beongs.» Reation has ony the attributes attached to that E.S. + key. #06 Reationa Mode HUST,Wuhan,China 144
25 Subcasses -> Reations (II)» 3. Use nus. Create one reation for the root cass or root E.S., with a attributes found anywhere in its network of subcasses.» Put NULL in attributes not reevant to an object/entity. #06 Reationa Mode HUST,Wuhan,China 145
26 Exampe name Beers manf isa coor Aes #06 Reationa Mode HUST,Wuhan,China 146
27 Exampe (II) interface Beers (key name) { attribute string name; attribute string manf; } interface Aes:Beers { attribute string coor; } #06 Reationa Mode HUST,Wuhan,China 147
28 ODL Stye Name Bud Beers manf A.B. Name manf coor Summerbrew Pete s dark #06 Reationa Mode HUST,Wuhan,China 148
29 E/R Stye Name Bud SummerBrew Beers manf A.B. Pete s Name SummerBrew coor dark Aes #06 Reationa Mode HUST,Wuhan,China 149
30 Using Nus Name manf coor Bud A.B. NULL SummerBrew Pete s dark Beers #06 Reationa Mode HUST,Wuhan,China 150
31 Design Chaenge Remember the probem with oca and express trains and oca and express stations?» Trains have numbers and engineers.» Stations have names and addresses.» There is a time for each train/station pair where a stop occurs. How woud we best represent this information as reations? Can we design the database schema so it is impossibe for an express train to have a stop time for a oca station? Shoud we? #06 Reationa Mode HUST,Wuhan,China 151
CS54100: Database Systems
CS54100: Database Systems Data Modeling 13 January 2012 Prof. Chris Clifton Main categories of data models Logical models: used to describe, organize and access data in DBMS; application programs refers
More informationThe Relational Model
The Relational Model CS 317, Fall 2007 Course outline Weeks 1 7: Relational Data Models E/R models. Weeks 1 3. The relational model. Next 4 weeks. Convert E/R to relational schemas. Functional and multi
More informationOuterjoins, Constraints, Triggers
Outerjoins, Constraints, Triggers Lecture #13 Autumn, 2001 Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 358 Outerjoin R S = R S with danging tupes padded with nus and incuded in
More informationEntity-Relationship Model. Purpose of E/R Model
Entity-Relationship Model Slides adapted from http://infolab.stanford.edu/~ullman/fcdb.html 1 Purpose of E/R Model The E/R model allows us to sketch database schema designs. Includes some constraints,
More informationEntity-Relationship Model
Entity-Relationship Model 1 Purpose of E/R Model The E/R model allows us to sketch database schema designs Includes some constraints, but not operations Designs are pictures called entity-relationship
More informationMore Relation Model: Functional Dependencies
More Reation Mode: Functiona Dependencies Lecture #7 Autumn, 2001 Fa, 2001, LRX #07 More Reation Mode: Functiona Dependencies HUST,Wuhan,China 152 Functiona Dependencies X -> A = assertion about a reation
More informationCS 317/387. A Relation is a Table. Schemas. Towards SQL - Relational Algebra. name manf Winterbrew Pete s Bud Lite Anheuser-Busch Beers
CS 317/387 Towards SQL - Relational Algebra A Relation is a Table Attributes (column headers) Tuples (rows) name manf Winterbrew Pete s Bud Lite Anheuser-Busch Beers Schemas Relation schema = relation
More informatione e Conceptual design begins with the collection of requirements and results needed from the database (ER Diag.)
Instructor: Jinze Liu Fall 2008 Phases of Database Design Data Requirements e e Conceptual design begins with the collection of requirements and results needed from the database (ER Diag.) Conceptual Design
More informationKEYS WEAK ENTITY SETS EXAMPLE: WEAK ENTITY SET EXAMPLE: WEAK ENTITY SET. Beers. Ales. Players. Teams ISA. and. Plays-on
KEYS In an ISA hierarchy, only the root entity set has a key, and it must serve as the key for all entities in the hierarchy. WEAK ENTITY SETS Occasionally, entities of an entity set need help to identify
More informationFrom E/R Diagrams to Relations
From E/R Diagrams to Relations Entity set relation Attributes attributes Relationships relations whose attributes are only: The keys of the connected entity sets Attributes of the relationship itself 1
More informationE/R Diagrams! Converting E/R Diagrams to Relations!
E/R Diagrams! Converting E/R Diagrams to Relations! DB design is a serious and possibly complex business.! A client may know they want a database, but they donʼt know what they want in it or how it should
More informationSQL3 Objects. Lecture #20 Autumn, Fall, 2001, LRX
SQL3 Objects Lecture #20 Autumn, 2001 #20 SQL3 Objects HUST,Wuhan,China 588 Objects in SQL3 OQL extends C++ with database concepts, whie SQL3 extends SQL with OO concepts. #20 SQL3 Objects HUST,Wuhan,China
More informationDatabases and PHP. Storing and Retrieving information
Databases and PHP Storing and Retrieving information A database is just information or data stored in a structured manner Database goa: To organize some data in a manner that makes it easy to reate, store,
More informationDesign Techniques. 1. Avoid redundancy 2. Limit the use of weak entity sets 3. Don t use an entity set when an attribute will do
Design Techniques 1. Avoid redundancy 2. Limit the use of weak entity sets 3. Don t use an entity set when an attribute will do 1 Avoiding Redundancy Redundancy = saying the same thing in two (or more)
More informationER Model. CSC 343 Winter 2018 MICHAEL LIUT
ER Model CSC 343 Winter 2018 MICHAEL LIUT (MICHAEL.LIUT@UTORONTO.CA) DEPARTMENT OF MATHEMATICAL AND COMPUTATIONAL SCIENCES UNIVERSITY OF TORONTO MISSISSAUGA Overview of Database Design Conceptual Designs
More informationIntroduction to SQL. Multirelation Queries Subqueries. Slides are reused by the approval of Jeffrey Ullman s
Introduction to SQL Multirelation Queries Subqueries Slides are reused by the approval of Jeffrey Ullman s 1 Our Running Example All our SQL queries will be based on the following database schema. Underline
More informationChapter 2 The relational Model of data. Relational model introduction
Chapter 2 The relational Model of data Relational model introduction 1 Contents What is a data model? Basics of the relational model Next : How to define? How to query? Constraints on relations 2 What
More informationENTITY-RELATIONSHIP MODEL
Assigned reading: Chapter 4 ENTITY-RELATIONSHIP MODEL Lecture 1 Relational database model Used by all major commercial database systems Very simple model Query with high-level languages: simple yet expressive
More informationObject-Oriented Database Languages. Object Description Language Object Query Language
Object-Oriented Database Languages Object Description Language Object Query Language 1 Object-Oriented DBMS s Standards group: ODMG = Object Data Management Group. ODL = Object Description Language, like
More informationFrom ER Diagrams to the Relational Model. Rose-Hulman Institute of Technology Curt Clifton
From ER Diagrams to the Relational Model Rose-Hulman Institute of Technology Curt Clifton Review Entity Sets and Attributes Entity set: collection of things in the DB Attribute: property of an entity calories
More informationPL/SQL, Embedded SQL. Lecture #14 Autumn, Fall, 2001, LRX
PL/SQL, Embedded SQL Lecture #14 Autumn, 2001 Fa, 2001, LRX #14 PL/SQL,Embedded SQL HUST,Wuhan,China 402 PL/SQL Found ony in the Orace SQL processor (sqpus). A compromise between competey procedura programming
More informationAdministrivia. CS 235: Introduction to Databases. Examples. What is a DBMS? The DBMS Marketplace. Relational Model
Administrivia CS 235: Introduction to Databases Svetlozar Nestorov Three handouts today: Course info, Schedule, Slides. Latest info will always be online! Come to class! Ask questions! Give feedback! Have
More informationSQL Continued! Outerjoins, Aggregations, Grouping, Data Modification
SQL Continued! Outerjoins, Aggregations, Grouping, Data Modification 1 Outerjoins R OUTER JOIN S is the core of an outerjoin expression. It is modified by: 1. Optional NATURAL in front of OUTER. 2. Optional
More informationfile://j:\macmillancomputerpublishing\chapters\in073.html 3/22/01
Page 1 of 15 Chapter 9 Chapter 9: Deveoping the Logica Data Mode The information requirements and business rues provide the information to produce the entities, attributes, and reationships in ogica mode.
More informationMore SQL. Extended Relational Algebra Outerjoins, Grouping/Aggregation Insert/Delete/Update
More SQL Extended Relational Algebra Outerjoins, Grouping/Aggregation Insert/Delete/Update 1 The Extended Algebra δ = eliminate duplicates from bags. τ = sort tuples. γ = grouping and aggregation. Outerjoin
More informationCS145 Introduction. About CS145 Relational Model, Schemas, SQL Semistructured Model, XML
CS145 Introduction About CS145 Relational Model, Schemas, SQL Semistructured Model, XML 1 Content of CS145 Design of databases. E/R model, relational model, semistructured model, XML, UML, ODL. Database
More informationChapter 6 The database Language SQL as a tutorial
Chapter 6 The database Language SQL as a tutorial About SQL SQL is a standard database language, adopted by many commercial systems. ANSI SQL, SQL-92 or SQL2, SQL99 or SQL3 extends SQL2 with objectrelational
More informationEXTENDED RELATIONAL ALGEBRA OUTERJOINS, GROUPING/AGGREGATION INSERT/DELETE/UPDATE
More SQL EXTENDED RELATIONAL ALGEBRA OUTERJOINS, GROUPING/AGGREGATION INSERT/DELETE/UPDATE 1 The Extended Algebra δ = eliminate duplicates from bags. τ = sort tuples. γ = grouping and aggregation. Outerjoin
More informationLecture outline Graphics and Interaction Scan Converting Polygons and Lines. Inside or outside a polygon? Scan conversion.
Lecture outine 433-324 Graphics and Interaction Scan Converting Poygons and Lines Department of Computer Science and Software Engineering The Introduction Scan conversion Scan-ine agorithm Edge coherence
More informationDesign Theory for Relational Databases
By Marina Barsky Design Theory for Relational Databases Lecture 15 Functional dependencies: formal definition X Y is an assertion about a relation R that whenever two tuples of R agree on all the attributes
More informationIntroduction to SQL. Select-From-Where Statements Multirelation Queries Subqueries. Slides are reused by the approval of Jeffrey Ullman s
Introduction to SQL Select-From-Where Statements Multirelation Queries Subqueries Slides are reused by the approval of Jeffrey Ullman s 1 Why SQL? SQL is a very-high-level language. Say what to do rather
More informationRDF Objects 1. Alex Barnell Information Infrastructure Laboratory HP Laboratories Bristol HPL November 27 th, 2002*
RDF Objects 1 Aex Barne Information Infrastructure Laboratory HP Laboratories Bristo HPL-2002-315 November 27 th, 2002* E-mai: Andy_Seaborne@hp.hp.com RDF, semantic web, ontoogy, object-oriented datastructures
More informationCSCI3030U Database Models
CSCI3030U Database Models CSCI3030U RELATIONAL MODEL SEMISTRUCTURED MODEL 1 Content Design of databases. relational model, semistructured model. Database programming. SQL, XPath, XQuery. Not DBMS implementation.
More informationChapter 6 The database Language SQL as a tutorial
Chapter 6 The database Language SQL as a tutorial About SQL SQL is a standard database language, adopted by many commercial systems. ANSI SQL, SQL-92 or SQL2, SQL99 or SQL3 extends SQL2 with objectrelational
More informationIntroduction to SQL SELECT-FROM-WHERE STATEMENTS SUBQUERIES DATABASE SYSTEMS AND CONCEPTS, CSCI 3030U, UOIT, COURSE INSTRUCTOR: JAREK SZLICHTA
Introduction to SQL SELECT-FROM-WHERE STATEMENTS MULTIRELATION QUERIES SUBQUERIES 1 SQL SQL is a standard language for accessing databases. SQL stands for Structured Query Language. SQL lecture s material
More informationBİL 354 Veritabanı Sistemleri. Relational Model (İlişkisel Veri Modeli)
BİL 354 Veritabanı Sistemleri Relational Model (İlişkisel Veri Modeli) DB Modeling & Implementation Ideas Database Model (E/R, ODL) Relational Schema Physical storage Diagrams (E/R) Tables: column names:
More informationWelcome - CSC 301. CSC 301- Foundations of Programming Languages
Wecome - CSC 301 CSC 301- Foundations of Programming Languages Instructor: Dr. Lutz Hame Emai: hame@cs.uri.edu Office: Tyer, Rm 251 Office Hours: TBA TA: TBA Assignments Assignment #0: Downoad & Read Syabus
More informationExtracting semistructured data from the Web: An XQuery Based Approach
EurAsia-ICT 2002, Shiraz-Iran, 29-31 Oct. Extracting semistructured data from the Web: An XQuery Based Approach Gies Nachouki Université de Nantes - Facuté des Sciences, IRIN, 2, rue de a Houssinière,
More informationSQL: Data Manipulation Language
SQL: Data Manipulation Language CSC 343 Winter 2018 MICHAEL LIUT (MICHAEL.LIUT@UTORONTO.CA) DEPARTMENT OF MATHEMATICAL AND COMPUTATIONAL SCIENCES UNIVERSITY OF TORONTO MISSISSAUGA Why SQL? SQL is a very-high-level
More informationSpecial Edition Using Microsoft Excel Selecting and Naming Cells and Ranges
Specia Edition Using Microsoft Exce 2000 - Lesson 3 - Seecting and Naming Ces and.. Page 1 of 8 [Figures are not incuded in this sampe chapter] Specia Edition Using Microsoft Exce 2000-3 - Seecting and
More informationIntroduction to Database Systems
Introduction to Database Systems Lecture #1 Autumn, 2001 Fa, 2001, LRX #01 Introduction to Database Systems HUST,Wuhan,China 1 Basic Information Course name: Database System Design (DSD) Course number:
More informationNearest Neighbor Learning
Nearest Neighbor Learning Cassify based on oca simiarity Ranges from simpe nearest neighbor to case-based and anaogica reasoning Use oca information near the current query instance to decide the cassification
More informationIntroduction to SQL. Select-From-Where Statements Multirelation Queries Subqueries
Introduction to SQL Select-From-Where Statements Multirelation Queries Subqueries 122 Why SQL? SQL is a very-high-level language. Say what to do rather than how to do it. Database management system figures
More informationRelational Database Design Part I. Announcement. Relational model: review. CPS 116 Introduction to Database Systems
Relational Database Design Part I CPS 116 Introduction to Database Systems Announcement 2 DB2 accounts created; change your password! Let me know if you have NOT received the email Pick up Gradiance registration
More informationDatabases-1 Lecture-01. Introduction, Relational Algebra
Databases-1 Lecture-01 Introduction, Relational Algebra Information, 2018 Spring About me: Hajas Csilla, Mathematician, PhD, Senior lecturer, Dept. of Information Systems, Eötvös Loránd University of Budapest
More informationindex.pdf March 17,
index.pdf March 17, 2013 1 ITI 1121. Introduction to omputing II Marce Turcotte Schoo of Eectrica Engineering and omputer Science Linked List (Part 2) Tai pointer ouby inked ist ummy node Version of March
More informationDatabase Design and Programming
Database Design and Programming Jan Baumbach jan.baumbach@imada.sdu.dk http://www.baumbachlab.net Example: EXISTS Set of beers with the same manf as b1, but not the same beer SELECT name FROM Beers b1
More informationSubqueries. Must use a tuple-variable to name tuples of the result
Subqueries A parenthesized SELECT-FROM-WHERE statement (subquery) can be used as a value in a number of places, including FROM and WHERE clauses Example: in place of a relation in the FROM clause, we can
More informationAnnouncement. Relational Database Design Part I. Keys. Relational model: review. Schema vs. data. More examples of keys
Announcement 2 Relational Database Design Part I CPS 116 troduction to Database Systems DB2 accounts created; change your password! Let me know if you have NOT received the email Pick up Gradiance registration
More informationThe Relational Data Model. Functional Dependencies. Example. Functional Dependencies
The Relational Data Model Functional Dependencies 1 Functional Dependencies X -> A is an assertion about a relation R that whenever two tuples of R agree on all the attributes of X, then they must also
More informationCOURSE 11. Object-Oriented Databases Object Relational Databases
COURSE 11 Object-Oriented Databases Object Relational Databases 1 The Need for a DBMS On one hand we have a tremendous increase in the amount of data applications have to handle, on the other hand we want
More informationRelational Database Design Part II. Announcements. E/R model: review. CPS 116 Introduction to Database Systems
Relational Database Design Part II CPS 116 Introduction to Database Systems Announcements 2 Homework #1 due in 7 days (Thursday, Sept. 9) Details of the course project and presentations will be available
More informationWhy SQL? SQL is a very-high-level language. Database management system figures out best way to execute query
Basic SQL Queries 1 Why SQL? SQL is a very-high-level language Say what to do rather than how to do it Avoid a lot of data-manipulation details needed in procedural languages like C++ or Java Database
More informationFrom i* to istar 2.0: An Evolving Social Modelling Language
From i* to istar 2.0: An Evoving Socia Modeing Language Lin Liu 1 Schoo of Software, Tsinghua University, Beijing, 100084, China iniu@tsinghua.edu.cn Abstract. Conceptua Modeing, as a thought too, heps
More informationSection 3: Exploring 3D shapes
Section 3: Exporing 3D shapes Contents Section 3: Exporing 3D shapes 3 1. Using practica work 3 2. A cross-curricuar approach 5 3. Using practica work to consoidate earning 6 Resource 1: Coecting and making
More informationConceptual Design with ER Model
Conceptual Design with ER Model Lecture #2 1/24/2012 Jeff Ballard CS564, Spring 2014, Database Management Systems 1 See the Moodle page Due February 7 Groups of 2-3 people Pick a team name Homework 1 is
More informationApplied Databases. Sebastian Maneth. Lecture 5 ER Model, Normal Forms. University of Edinburgh - January 30 th, 2017
Applied Databases Lecture 5 ER Model, Normal Forms Sebastian Maneth University of Edinburgh - January 30 th, 2017 Outline 2 1. Entity Relationship Model 2. Normal Forms From Last Lecture 3 the Lecturer
More informationI Relational Database Modeling how to define
I Relational Database Modeling how to define Relational Model data structure, operations, constraints Design theory for relational database High-level Models E/R model, UML model, ODL II Relational Database
More informationSQL DATA DEFINITION LANGUAGE
SQL DATA DEFINITION LANGUAGE DATABASE SCHEMAS IN SQL SQL is primarily a query language, for getting information from a database. DML: Data Manipulation Language SFWR ENG 3DB3 FALL 2016 MICHAEL LIUT (LIUTM@MCMASTER.CA)
More informationComputer Networks. College of Computing. Copyleft 2003~2018
Computer Networks Prof. Lin Weiguo Coege of Computing Copyeft 2003~2018 inwei@cuc.edu.cn http://icourse.cuc.edu.cn/computernetworks/ http://tc.cuc.edu.cn Internet Contro Message Protoco (ICMP), RFC 792
More informationViews, Indexes, Authorization. Views. Views 8/6/18. Virtual and Materialized Views Speeding Accesses to Data Grant/Revoke Priviledges
Views, Indexes, Authorization Virtual and Materialized Views Speeding Accesses to Data Grant/Revoke Priviledges 1 Views External Schema (Views) Conceptual Schema Physical Schema 2 Views A view is a relation
More informationApplied Databases. Sebastian Maneth. Lecture 5 ER Model, normal forms. University of Edinburgh - January 25 th, 2016
Applied Databases Lecture 5 ER Model, normal forms Sebastian Maneth University of Edinburgh - January 25 th, 2016 Outline 2 1. Entity Relationship Model 2. Normal Forms Keys and Superkeys 3 Superkey =
More informationXML Query Data Model. W3C Working Draft 11 May Abstract. Status of this document
XML Query Data Mode W3C Working Draft 11 May 2000 This version: http://www.w3.org/tr/2000/wd-query-datamode-20000511 Latest version: http://www.w3.org/tr/query-datamode Editors: Mary Fernandez (AT&T Labs)
More informationAnnouncements (January 20) Relational Database Design. Database (schema) design. Entity-relationship (E/R) model. ODL (Object Definition Language)
Announcements (January 20) 2 Relational Database Design Review for Codd paper due tonight via email Follow instructions on course Web site Reading assignment for next week (Ailamaki et al., VLDB 2001)
More informationunderstood as processors that match AST patterns of the source language and translate them into patterns in the target language.
A Basic Compier At a fundamenta eve compiers can be understood as processors that match AST patterns of the source anguage and transate them into patterns in the target anguage. Here we wi ook at a basic
More informationSQL DATA DEFINITION LANGUAGE
SQL DATA DEFINITION LANGUAGE DATABASE SCHEMAS IN SQL SQL is primarily a query language, for getting information from a database. DML: Data Manipulation Language SFWR ENG 3DB3 FALL 2016 MICHAEL LIUT (LIUTM@MCMASTER.CA)
More informationRelational Database Design Part I. Announcements (September 5) Relational model: review. CPS 116 Introduction to Database Systems
Relational Database Design Part I CPS 116 Introduction to Database Systems Announcements (September 5) 2 rack040 accounts created; change your password! Let me know if you have NOT received the email Homework
More informationSolutions to the Final Exam
CS/Math 24: Intro to Discrete Math 5//2 Instructor: Dieter van Mekebeek Soutions to the Fina Exam Probem Let D be the set of a peope. From the definition of R we see that (x, y) R if and ony if x is a
More informationSQL DATA DEFINITION LANGUAGE
9/27/16 DATABASE SCHEMAS IN SQL SQL DATA DEFINITION LANGUAGE SQL is primarily a query language, for getting information from a database. SFWR ENG 3DB3 FALL 2016 But SQL also includes a data-definition
More informationNCH Software Spin 3D Mesh Converter
NCH Software Spin 3D Mesh Converter This user guide has been created for use with Spin 3D Mesh Converter Version 1.xx NCH Software Technica Support If you have difficuties using Spin 3D Mesh Converter
More informationKnowledge-Based Computer Vision
Knowedge-Based Computer Vision ntegrated Programming Language and Data Management System Design Andrew M. Goodman, Robert M. Haraick, and Linda G. Shapiro University of Washington T he anguages that come
More informationSQL: Data Definition Language
SQL: Data Definition Language CSC 343 Winter 2018 MICHAEL LIUT (MICHAEL.LIUT@UTORONTO.CA) DEPARTMENT OF MATHEMATICAL AND COMPUTATIONAL SCIENCES UNIVERSITY OF TORONTO MISSISSAUGA Database Schemas in SQL
More informationFunctions. 6.1 Modular Programming. 6.2 Defining and Calling Functions. Gaddis: 6.1-5,7-10,13,15-16 and 7.7
Functions Unit 6 Gaddis: 6.1-5,7-10,13,15-16 and 7.7 CS 1428 Spring 2018 Ji Seaman 6.1 Moduar Programming Moduar programming: breaking a program up into smaer, manageabe components (modues) Function: a
More informationI Relational Database Modeling how to define
I Relational Database Modeling how to define Relational Model data structure, operations, constraints Design theory for relational database High-level Models E/R model, UML model, ODL II Relational Database
More informationConceptual Design. The Entity-Relationship (ER) Model
Conceptual Design. The Entity-Relationship (ER) Model CS430/630 Lecture 12 Slides based on Database Management Systems 3 rd ed, Ramakrishnan and Gehrke Database Design Overview Conceptual design The Entity-Relationship
More informationExam I Computer Science 420 Dr. St. John Lehman College City University of New York 12 March 2002
Exam I Computer Science 420 Dr. St. John Lehman College City University of New York 12 March 2002 NAME (Printed) NAME (Signed) E-mail Exam Rules Show all your work. Your grade will be based on the work
More informationl A set is a collection of objects of the same l {6,9,11,-5} and {11,9,6,-5} are equivalent. l There is no first element, and no successor of 9.
Sets & Hash Tabes Week 13 Weiss: chapter 20 CS 5301 Spring 2018 What are sets? A set is a coection of objects of the same type that has the foowing two properties: - there are no dupicates in the coection
More informationHour 3: The Network Access Layer Page 1 of 10. Discuss how TCP/IP s Network Access layer relates to the OSI networking model
Hour 3: The Network Access Layer Page 1 of 10 Hour 3: The Network Access Layer At the base of the TCP/IP protoco stack is the Network Access ayer, the coection of services and specifications that provide
More informationSection 3 : Exploring 3D shapes
Section 3 : Exporing 3D shapes Copyright 2016 The Open University Contents Section 3: Exporing 3D shapes 3 1. Using practica work 3 2. A cross-curricuar approach 4 3. Using practica work to consoidate
More informationThe Internet and the web
The Internet and the web Contents Introduction 3 1 The Internet at home 4 2 Loca Area Networks sma office/home office 5 3 Loca Area Networks business 6 4 Wide Area Networks 8 5 Wireess networks 9 6 Mobie
More informationRunning Example Tables name location
Running Example Pubs-Drinkers-DB: The data structures of the relational model Attributes and domains Relation schemas and database schemas databases Pubs (name, location) Drinkers (name, location) Sells
More informationJacobian Range Space
Kinematic Redundanc A manipuator ma have more DOFs than are necessar to contro a desired variabe What do ou do w/ the etra DOFs? However, even if the manipuator has enough DOFs, it ma sti be unabe to contro
More informationCSE120 Principles of Operating Systems. Prof Yuanyuan (YY) Zhou Lecture 4: Threads
CSE120 Principes of Operating Systems Prof Yuanyuan (YY) Zhou Lecture 4: Threads Announcement Project 0 Due Project 1 out Homework 1 due on Thursday Submit it to Gradescope onine 2 Processes Reca that
More informationAn Introduction to Design Patterns
An Introduction to Design Patterns 1 Definitions A pattern is a recurring soution to a standard probem, in a context. Christopher Aexander, a professor of architecture Why woud what a prof of architecture
More informationRelational Database Design. Announcements. Database (schema) design. CPS 216 Advanced Database Systems. DB2 accounts have been set up
Relational Database Design CPS 216 Advanced Database Systems Announcements 2 DB2 accounts have been set up Let me know if you have not received an email from me regarding your account Recitation session
More informationAs Michi Henning and Steve Vinoski showed 1, calling a remote
Reducing CORBA Ca Latency by Caching and Prefetching Bernd Brügge and Christoph Vismeier Technische Universität München Method ca atency is a major probem in approaches based on object-oriented middeware
More informationDatabases 1. Defining Tables, Constraints
Databases 1 Defining Tables, Constraints DBMS 2 Rest of SQL Defining a Database Schema Primary Keys, Foreign Keys Local and Global Constraints Defining Views Triggers 3 Defining a Database Schema A database
More informationContents. Database. Information Policy. C03. Entity Relationship Model WKU-IP-C03 Database / Entity Relationship Model
Information Policy Database C03. Entity Relationship Model Code: 164323-03 Course: Information Policy Period: Spring 2013 Professor: Sync Sangwon Lee, Ph. D 1 Contents 01. Overview of Database Design 02.
More informationNeural Network Enhancement of the Los Alamos Force Deployment Estimator
Missouri University of Science and Technoogy Schoars' Mine Eectrica and Computer Engineering Facuty Research & Creative Works Eectrica and Computer Engineering 1-1-1994 Neura Network Enhancement of the
More informationConstraints. Local and Global Constraints Triggers
Constraints Foreign Keys Local and Global Constraints Triggers 1 Constraints and Triggers A constraint is a relationship among data elements that the DBMS is required to enforce. Example: key constraints.
More informationCSCI 127 Introduction to Database Systems
CSCI 127 Introduction to Database Systems Integrity Constraints and Functional Dependencies Integrity Constraints Purpose: Prevent semantic inconsistencies in data e.g.: cname svngs check total Joe 100
More informationConstraints and Triggers
Constraints 1 Constraints and Triggers A constraint is a relationship among data elements that the DBMS is required to enforce Example: key constraints Triggers are only executed when a specified condition
More informationOutline. Introduce yourself!! What is Machine Learning? What is CAP-5610 about? Class information and logistics
Outine Introduce yoursef!! What is Machine Learning? What is CAP-5610 about? Cass information and ogistics Lecture Notes for E Apaydın 2010 Introduction to Machine Learning 2e The MIT Press (V1.0) About
More informationChapter 11 Object and Object- Relational Databases
Chapter 11 Object and Object- Relational Databases Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 11 Outline Overview of Object Database Concepts Object-Relational
More informationThe Entity- Relationship Model
The Entity- Reationship Mode B term 2004: ectures 2, 3 Database Design Stages Appication Requirements Conceptua Design Conceptua Schema Logica Design Logica Schema Physica Design Physica Schema 1 Conceptua
More informationFunctional Dependencies
Functional Dependencies Meaning of FD s Keys and Superkeys Inferring FD s 1 Motivation Consider the relation: Students(Id, Name, AdvisorId, AdvisorName, FavouriteAdvisorId) 2 1 Motivation (2) If you know
More informationMay 13, Mark Lutz Boulder, Colorado (303) [work] (303) [home]
"Using Python": a Book Preview May 13, 1995 Mark Lutz Bouder, Coorado utz@kapre.com (303) 546-8848 [work] (303) 684-9565 [home] Introduction. This paper is a brief overview of the upcoming Python O'Reiy
More informationChapter 2 The relational Model of data. Relational algebra
Chapter 2 The relational Model of data Relational algebra 1 Contents What is a data model? Basics of the relational model How to define? How to query? Constraints on relations 2 An algebraic query language
More informationAlpha labelings of straight simple polyominal caterpillars
Apha abeings of straight simpe poyomina caterpiars Daibor Froncek, O Nei Kingston, Kye Vezina Department of Mathematics and Statistics University of Minnesota Duuth University Drive Duuth, MN 82-3, U.S.A.
More informationFinal Review. Zaki Malik November 20, 2008
Final Review Zaki Malik November 20, 2008 Basic Operators Covered Renaming If two relations have the same attribute, disambiguate the attributes by prefixing the attribute with the name of the relation
More information