Outerjoins, Constraints, Triggers
|
|
- Marlene Washington
- 5 years ago
- Views:
Transcription
1 Outerjoins, Constraints, Triggers Lecture #13 Autumn, 2001 Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 358
2 Outerjoin R S = R S with danging tupes padded with nus and incuded in the resut. A tupe is danging if it doesn't join with any other tupe. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 359
3 Danging Tupes R = A B S = B C R S = A B C NULL NULL 7 8 Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 360
4 Outerjoin in SQL2 A number of forms are provided.»can be used either stand-aone (in pace of a seect-from-where) or to define a reation in the FROM-cause. R NATURAL JOIN S R JOIN S ON condition e.g., condition: R:B = S:B R CROSS JOIN S R OUTER JOIN S Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 361
5 Outerjoin in SQL2 (II) The atter can be modified by:»optiona NATURAL in front of JOIN.»Optiona ON condition at end.»optiona LEFT, RIGHT, or FULL before OUTER. LEFT = pad danging tupes of R ony; RIGHT = pad danging tupes of S ony. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 362
6 Orace Outerjoin Orace has no such thing.»but parenthesized seect-from-where aowed in a FROM cause. Reay a way to define a view and use it in a singe query. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 363
7 Exampe Find the average over a bars of the maximum price the bar charges for a beer. Ses(bar, beer, price) SELECT AVG(maxPrice) FROM (SELECT bar, MAX(price) AS maxprice FROM Ses GROUP BY Bar); Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 364
8 Probem Can we express the outerjoin in Orace SQL as some more compicated expression? Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 365
9 Constraints Commercia reationa systems aow much more "fine-tuning" of constraints than do the modeing anguages we earned earier. In essence: SQL programming is used to describe constraints. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 366
10 Outine» 1. Primary key decarations (covered).» 2. Foreign-keys = referentia integrity constraints. E.g., if Ses mentions a beer, then we shoud be abe to find that beer in Beers.» 3. Attribute- and tupe-based checks = constraints within reations.» 4. SQL2 Assertions = goba constraints. Not found in Orace » 5. Orace Triggers. A substitute for assertions.» 6. SQL3 triggers and assertions. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 367
11 Foreign Keys In reation R a cause that "attribute A references S ( B )" says that whatever vaues appear in the A coumn of R must aso appear in the B coumn of reation S.»B must be decared the primary key for S. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 368
12 Exampe CREATE TABLE Beers ( name CHAR(20) PRIMARY KEY, manf CHAR(20) ); CREATE TABLE Ses ( bar CHAR(20), beer CHAR(20) REFERENCES Beers(name), price REAL ); Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 369
13 Aternative Add another eement decaring the foreign key, as: CREATE TABLE Ses ( bar CHAR(20), beer CHAR(20), price REAL, FOREIGN KEY beer REFERENCES Beers(name) ); Extra eement essentia if the foreign key is more than one attribute. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 370
14 What Happens When a Foreign Key Constraint is Vioated? Two ways:»1. Insert a Ses tupe referring to a nonexistent beer. Aways rejected.»2. Deete or update a Beers tupe that has a beer vaue some Ses tupes refer to. a) Defaut: reject. b) Cascade: Rippe changes to referring Ses tupe. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 371
15 Exampe Deete "Bud." Cascade deetes a Ses tupes that mention Bud. Update "Bud" "Budweiser." Change a Ses tupes with "Bud" in beer coumn to be "Budweiser." Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 372
16 What Happens When a Foreign Key Constraint is Vioated? (II) c) Set Nu : Change referring tupes to have NULL in referring components.»exampe Deete "Bud." Set-nu makes a Ses tupes with "Bud" in the beer component have NULL there. Update "Bud" "Budweiser." Same change. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 373
17 Seecting a Poicy Add ON [DELETE, UPDATE] [CASCADE, SET NULL] to decaration of foreign key. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 374
18 Seecting a Poicy (II) Exampe CREATE TABLE Ses ( bar CHAR(20), beer CHAR(20), price REAL, FOREIGN KEY beer REFERENCES Beers(name) ON DELETE SET NULL ON UPDATE CASCADE ); Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 375
19 Seecting a Poicy (III) "Correct" poicy is a design decision.»e.g., what does it mean if a beer goes away? What if a beer changes its name? Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 376
20 Attribute-Based Checks Foow an attribute by a condition that must hod for that attribute in each tupe of its reation. Form: CHECK (condition).» Condition may invove the checked attribute.» Other attributes and reations may be invoved, but ony in subqueries.» Orace 8.0.5: No subqueries aowed in condition. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 377
21 Attribute-Based Checks Condition is checked ony when the associated attribute changes (i.e., an insert or update occurs). Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 378
22 Exampe CREATE TABLE Ses ( bar CHAR(20), beer CHAR(20) CHECK( beer IN (SELECT name FROM Beers) ), price REAL CHECK( price <= 5.00 ) ); Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 379
23 Attribute-Based Checks (III) Check on beer is ike a foreign-key constraint, except»the check occurs ony when we add a tupe or change the beer in an existing tupe, not when we deete a tupe from Beers. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 380
24 Tupe-Based Checks Separate eement of tabe decaration. Form: ike attribute-based check. But condition can refer to any attribute of the reation.»or to other reations/attributes in subqueries.»again: Orace forbids the use of subqueries. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 381
25 Exampe Ony Joe's Bar can se beer for more than $5. CREATE TABLE Ses ( bar CHAR(20), beer CHAR(20), price REAL, CHECK(bar = 'Joe''s Bar' OR price <= 5.00) ); Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 382
26 Triggers Often caed event-condition-action rues. Event = a cass of changes in the DB, e.g., "insert into Beers." Condition = a test as in a where-cause for whether or not the trigger appies. Action = one or more SQL statements. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 383
27 Triggers (II) Orace version and SQL3 version; not in SQL2. Differ from checks or SQL2 assertions in that:»1. Event is programmabe, rather than impied by the kind of check.»2. Condition not avaiabe in checks. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 384
28 Exampe Whenever we insert a new tupe into Ses, make sure the beer mentioned is aso mentioned in Beers, and insert it (with a nu manufacturer) if not. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 385
29 Exampe (II) Ses(bar, beer, price) CREATE OR REPLACE TRIGGER BeerTrig AFTER INSERT ON Ses FOR EACH ROW WHEN(new.beer NOT IN (SELECT name FROM Beers)) BEGIN INSERT INTO Beers(name) VALUES(:new.beer); END;. Run Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 386
30 Options Can omit OR REPLACE. Effect is that it is an error if a trigger of this name exists. AFTER can be BEFORE. INSERT can be DELETE or UPDATE OF < attribute > ON. FOR EACH ROW can be omitted, with an important effect: the action is done once for the reation(s) consisting of a changes. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 387
31 Notes There are two specia variabes new and od, representing the new and od tupe in the change.»od makes no sense in an insert, and new makes no sense in a deete. Notice: in WHEN we use new and od without a coon, but in actions, a preceding coon is needed. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 388
32 Notes (II) The action is a PL/SQL statement.»simpest form: surround one or more SQL statements with BEGIN and END.»However, seect-from-where has a imited form. Dot and run cause the definition of the trigger to be stored in the database.»orace triggers are eements of the database, ike tabes or views. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 389
33 Exampe Maintain a ist of a the bars that raise their price for some beer by more than $1. Ses(bar, beer, price) Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 390
34 Exampe (II) CREATE TRIGGER PriceTrig AFTER UPDATE OF price ON Ses FOR EACH ROW WHEN(new.price > od.price ) BEGIN INSERT INTO RipoffBars VALUES(:new.bar); END;. run Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 391
35 SQL3 Triggers Some differences, incuding:» Position of FOR EACH ROW.» You can execute the action INSTEAD OF as we as before or after the event that triggered the action.» The Orace restriction about not modifying the reation of the trigger or other reations inked to it by constraints is not present in SQL3 (but Orace is rea; SQL3 is paper).» 4. The action in SQL3 is a ist of SQL3 statements, not a PL/SQL statement. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 392
36 SQL2 Assertions Database-schema constraint. Not present in Orace Checked whenever a mentioned reation changes. Syntax: CREATE ASSERTION <name> CHECK(<condition>); Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 393
37 Exampe No bar may charge an average of more than $5 for beer. Ses(bar, beer, price) CREATE ASSERTION NoRipoffBars CHECK(NOT EXISTS( SELECT bar FROM Ses GROUP BY bar HAVING 5.0 < AVG(price) ) ); Checked whenever Ses changes. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 394
38 Exampe There cannot be more bars than drinkers. Bars(name, addr, icense) Drinkers(name, addr, phone) CREATE ASSERTION FewBar CHECK( (SELECT COUNT(*) FROM Bars)!= (SELECT COUNT(*) FROM Drinkers) ); Checked whenever Bars or Drinkers changes. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 395
39 Chaenge Suppose we have our usua reations Beers(name, manf) Ses(bar, beer, price) and we want to maintain the foreign-key constraint that if you se a beer, its name must appear in Beers. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 396
40 Chaenge (II) Question: if we don't have foreign-key decarations avaiabe, how coud we arrange for this constraint to be maintained:»using attribute-based constraints?»using SQL2 assertions?»using Orace triggers? Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 397
41 Chaenge (III) Question: What if we aso want to make sure that each beer mentioned in Beers is sod at at east one bar? Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 398
42 Another Constraints Probem Reca our design of a DB for cities, counties and states, especiay how we decided that we needed a reationship cities-states to support the "weakness" of cities. A DB schema might have:» States(name, pop, capita)» Cities(name, pop, state)» Counties(name, pop, state)» CinC(cityName, citystate, countyname, countystate) Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 399
43 Another Constraints Probem (II) There is a funny form of redundancy, because we expect to be abe to find the state of a city by going to any county for that city and finding the state of that county. Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 400
44 Another Constraints Probem (III) Question: as written, is it possibe for a city to be in counties that are in two different states? How woud you enforce the requirement that that not happen? Question: if we are wiing to enforce the constraint, can you simpify the database schema? Shoud you? Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 401
A tuple is dangling if it doesn't join with any
Outerjoin R./ S = R./Swith dangling tuples padded with nulls and included in the result. A tuple is dangling if it doesn't join with any other tuple. R = A B 1 2 3 4 S = B C 2 5 2 6 7 8 R./ S = A B C 1
More informationCS54100: Database Systems
CS54100: Database Systems SQL DDL 27 January 2012 Prof. Chris Clifton Defining a Database Schema CREATE TABLE name (list of elements). Principal elements are attributes and their types, but key declarations
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 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 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 informationRelational Model. Lecture #6 Autumn, Fall, 2001, LRX
Reationa Mode Lecture #6 Autumn, 2001 #06 Reationa Mode HUST,Wuhan,China 121 Reationa Mode Tabe = reation. Coumn headers = attributes. Row = tupe Reation schema = name(attributes). Exampe: Beers(name,
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 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 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 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 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 informationInterpretation is not exactly ëmissing value." There could be many reasons why no value is
Nulls In place of a value in a tuple's component. Interpretation is not exactly ëmissing value." There could be many reasons why no value is present, e.g., ëvalue inappropriate." Comparing Nulls to Values
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 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 informationStraight-line code (or IPO: Input-Process-Output) If/else & switch. Relational Expressions. Decisions. Sections 4.1-6, , 4.
If/ese & switch Unit 3 Sections 4.1-6, 4.8-12, 4.14-15 CS 1428 Spring 2018 Ji Seaman Straight-ine code (or IPO: Input-Process-Output) So far a of our programs have foowed this basic format: Input some
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 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 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 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 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 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 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 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 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 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 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 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 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 informationMCSE TestPrep SQL Server 6.5 Design & Implementation - 3- Data Definition
MCSE TestPrep SQL Server 6.5 Design & Impementation - Data Definition Page 1 of 38 [Figures are not incuded in this sampe chapter] MCSE TestPrep SQL Server 6.5 Design & Impementation - 3- Data Definition
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 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 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 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 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 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 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 informationSample of a training manual for a software tool
Sampe of a training manua for a software too We use FogBugz for tracking bugs discovered in RAPPID. I wrote this manua as a training too for instructing the programmers and engineers in the use of FogBugz.
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 informationA Petrel Plugin for Surface Modeling
A Petre Pugin for Surface Modeing R. M. Hassanpour, S. H. Derakhshan and C. V. Deutsch Structure and thickness uncertainty are important components of any uncertainty study. The exact ocations of the geoogica
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 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 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 informationCS 464/564 Introduction to Database Management System Instructor: Abdullah Mueen
CS 464/564 Introduction to Database Management System Instructor: Abdullah Mueen LECTURE 12: CONSTRAINTS IN SQL Constraints Foreign Keys Local and Global Constraints Triggers 2 Constraints and Triggers
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 informationIntro to Programming & C Why Program? 1.2 Computer Systems: Hardware and Software. Why Learn to Program?
Intro to Programming & C++ Unit 1 Sections 1.1-3 and 2.1-10, 2.12-13, 2.15-17 CS 1428 Spring 2018 Ji Seaman 1.1 Why Program? Computer programmabe machine designed to foow instructions Program a set of
More informationChapter 7: Constraints and Triggers. Foreign Keys Local and Global Constraints Triggers
Chapter 7: Constraints and Triggers Foreign Keys Local and Global Constraints Triggers 27 Constraints and Triggers! A constraint is a relationship among data elements that the DBMS is required to enforce.!
More informationIntro to Programming & C Why Program? 1.2 Computer Systems: Hardware and Software. Hardware Components Illustrated
Intro to Programming & C++ Unit 1 Sections 1.1-3 and 2.1-10, 2.12-13, 2.15-17 CS 1428 Fa 2017 Ji Seaman 1.1 Why Program? Computer programmabe machine designed to foow instructions Program instructions
More informationl Tree: set of nodes and directed edges l Parent: source node of directed edge l Child: terminal node of directed edge
Trees & Heaps Week 12 Gaddis: 20 Weiss: 21.1-3 CS 5301 Fa 2016 Ji Seaman 1 Tree: non-recursive definition Tree: set of nodes and directed edges - root: one node is distinguished as the root - Every node
More informationChapter 5: Transactions in Federated Databases
Federated Databases Chapter 5: in Federated Databases Saes R&D Human Resources Kemens Böhm Distributed Data Management: in Federated Databases 1 Kemens Böhm Distributed Data Management: in Federated Databases
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 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 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 information(12) United States Patent
US006697794B1 (12) United States Patent (10) Patent N0.: Miby (45) Date of Patent: Feb. 24, 2004 (54) PROVDNG DATABASE SYSTEM NATVE 6,285,996 B1 * 9/2001 Jou et a1...... 707/2 OPERATONS FOR USER DEFNED
More informationReadme ORACLE HYPERION PROFITABILITY AND COST MANAGEMENT
ORACLE HYPERION PROFITABILITY AND COST MANAGEMENT Reease 11.1.2.4.000 Readme CONTENTS IN BRIEF Purpose... 2 New Features in This Reease... 2 Instaation Information... 2 Supported Patforms... 2 Supported
More informationAn Optimizing Compiler
An Optimizing Compier The big difference between interpreters and compiers is that compiers have the abiity to think about how to transate a source program into target code in the most effective way. Usuay
More informationNavigating and searching theweb
Navigating and searching theweb Contents Introduction 3 1 The Word Wide Web 3 2 Navigating the web 4 3 Hyperinks 5 4 Searching the web 7 5 Improving your searches 8 6 Activities 9 6.1 Navigating the web
More informationGuardian 365 Pro App Guide. For more exciting new products please visit our website: Australia: OWNER S MANUAL
Guardian 365 Pro App Guide For more exciting new products pease visit our website: Austraia: www.uniden.com.au OWNER S MANUAL Privacy Protection Notice As the device user or data controer, you might coect
More informationChapter 3: Introduction to the Flash Workspace
Chapter 3: Introduction to the Fash Workspace Page 1 of 10 Chapter 3: Introduction to the Fash Workspace In This Chapter Features and Functionaity of the Timeine Features and Functionaity of the Stage
More informationModeling of Problems of Projection: A Non-countercyclic Approach * Jason Ginsburg Osaka Kyoiku University
Modeing of Probems of Projection: A Non-countercycic Approach * Jason Ginsburg Osaka Kyoiku University Abstract This paper describes a computationa impementation of the recent Probems of Projection (POP)
More informationThe Big Picture WELCOME TO ESIGNAL
2 The Big Picture HERE S SOME GOOD NEWS. You don t have to be a rocket scientist to harness the power of esigna. That s exciting because we re certain that most of you view your PC and esigna as toos for
More informationDatabases and PHP. Accessing databases from PHP
Databases and PHP Accessing databases from PHP PHP & Databases PHP can connect to virtuay any database There are specific functions buit-into PHP to connect with some DB There is aso generic ODBC functions
More informationPath-Based Protection for Surviving Double-Link Failures in Mesh-Restorable Optical Networks
Path-Based Protection for Surviving Doube-Link Faiures in Mesh-Restorabe Optica Networks Wensheng He and Arun K. Somani Dependabe Computing and Networking Laboratory Department of Eectrica and Computer
More informationRegister Allocation. Consider the following assignment statement: x = (a*b)+((c*d)+(e*f)); In posfix notation: ab*cd*ef*++x
Register Aocation Consider the foowing assignment statement: x = (a*b)+((c*d)+(e*f)); In posfix notation: ab*cd*ef*++x Assume that two registers are avaiabe. Starting from the eft a compier woud generate
More informationLanguage Identification for Texts Written in Transliteration
Language Identification for Texts Written in Transiteration Andrey Chepovskiy, Sergey Gusev, Margarita Kurbatova Higher Schoo of Economics, Data Anaysis and Artificia Inteigence Department, Pokrovskiy
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 informationCSC 343 Winter SQL: Aggregation, Joins, and Triggers MICHAEL LIUT
SQL: Aggregation, Joins, and Triggers CSC 343 Winter 2018 MICHAEL LIUT (MICHAEL.LIUT@UTORONTO.CA) DEPARTMENT OF MATHEMATICAL AND COMPUTATIONAL SCIENCES UNIVERSITY OF TORONTO MISSISSAUGA Aggregation Operators
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 informationNCH Software Express Delegate
NCH Software Express Deegate This user guide has been created for use with Express Deegate Version 4.xx NCH Software Technica Support If you have difficuties using Express Deegate pease read the appicabe
More informationA Memory Grouping Method for Sharing Memory BIST Logic
A Memory Grouping Method for Sharing Memory BIST Logic Masahide Miyazai, Tomoazu Yoneda, and Hideo Fuiwara Graduate Schoo of Information Science, Nara Institute of Science and Technoogy (NAIST), 8916-5
More informationA SIMPLE APPROACH TO SPECIFYING CONCURRENT SYSTEMS
Artificia Inteigence and Language Processing ]acques Cohen Editor A SIMPLE APPROACH TO SPECIFYING CONCURRENT SYSTEMS LESLIE LAMPORT Over the past few years, I have deveoped an approach to the forma specification
More informationA METHOD FOR GRIDLESS ROUTING OF PRINTED CIRCUIT BOARDS. A. C. Finch, K. J. Mackenzie, G. J. Balsdon, G. Symonds
A METHOD FOR GRIDLESS ROUTING OF PRINTED CIRCUIT BOARDS A C Finch K J Mackenzie G J Basdon G Symonds Raca-Redac Ltd Newtown Tewkesbury Gos Engand ABSTRACT The introduction of fine-ine technoogies to printed
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 informationDistance Weighted Discrimination and Second Order Cone Programming
Distance Weighted Discrimination and Second Order Cone Programming Hanwen Huang, Xiaosun Lu, Yufeng Liu, J. S. Marron, Perry Haaand Apri 3, 2012 1 Introduction This vignette demonstrates the utiity and
More informationTutorial 3 Concepts for A1
CPSC 231 Introduction to Computer Science for Computer Science Majors I Tutoria 3 Concepts for A1 DANNY FISHER dgfisher@ucagary.ca September 23, 2014 Agenda script command more detais Submitting using
More informationDynamic Symbolic Execution of Distributed Concurrent Objects
Dynamic Symboic Execution of Distributed Concurrent Objects Andreas Griesmayer 1, Bernhard Aichernig 1,2, Einar Broch Johnsen 3, and Rudof Schatte 1,2 1 Internationa Institute for Software Technoogy, United
More informationCreating Tables, Defining Constraints. Rose-Hulman Institute of Technology Curt Clifton
Creating Tables, Defining Constraints Rose-Hulman Institute of Technology Curt Clifton Outline Data Types Creating and Altering Tables Constraints Primary and Foreign Key Constraints Row and Tuple Checks
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 informationFurther Concepts in Geometry
ppendix F Further oncepts in Geometry F. Exporing ongruence and Simiarity Identifying ongruent Figures Identifying Simiar Figures Reading and Using Definitions ongruent Trianges assifying Trianges Identifying
More informationBottom-Up Parsing LR(1)
Bottom-Up Parsing LR(1) Previousy we have studied top-down or LL(1) parsing. The idea here was to start with the start symbo and keep expanding it unti the whoe input was read and matched. In bottom-up
More informationInfinity Connect Web App Customization Guide
Infinity Connect Web App Customization Guide Contents Introduction 1 Hosting the customized Web App 2 Customizing the appication 3 More information 8 Introduction The Infinity Connect Web App is incuded
More informationBEA WebLogic Server. Release Notes for WebLogic Tuxedo Connector 1.0
BEA WebLogic Server Reease Notes for WebLogic Tuxedo Connector 1.0 BEA WebLogic Tuxedo Connector Reease 1.0 Document Date: June 29, 2001 Copyright Copyright 2001 BEA Systems, Inc. A Rights Reserved. Restricted
More informationLecture Notes for Chapter 4 Part III. Introduction to Data Mining
Data Mining Cassification: Basic Concepts, Decision Trees, and Mode Evauation Lecture Notes for Chapter 4 Part III Introduction to Data Mining by Tan, Steinbach, Kumar Adapted by Qiang Yang (2010) Tan,Steinbach,
More informationLoad Balancing by MPLS in Differentiated Services Networks
Load Baancing by MPLS in Differentiated Services Networks Riikka Susitaiva, Jorma Virtamo, and Samui Aato Networking Laboratory, Hesinki University of Technoogy P.O.Box 3000, FIN-02015 HUT, Finand {riikka.susitaiva,
More informationSupporting Top-k Join Queries in Relational Databases
Supporting Top-k Join Queries in Reationa Databases Ihab F. Iyas Waid G. Aref Ahmed K. Emagarmid Department of Computer Sciences, Purdue University West Lafayette IN 47907-1398 {iyas,aref,ake}@cs.purdue.edu
More informationECEn 528 Prof. Archibald Lab: Dynamic Scheduling Part A: due Nov. 6, 2018 Part B: due Nov. 13, 2018
ECEn 528 Prof. Archibad Lab: Dynamic Scheduing Part A: due Nov. 6, 2018 Part B: due Nov. 13, 2018 Overview This ab's purpose is to expore issues invoved in the design of out-of-order issue processors.
More informationMobile App Recommendation: Maximize the Total App Downloads
Mobie App Recommendation: Maximize the Tota App Downoads Zhuohua Chen Schoo of Economics and Management Tsinghua University chenzhh3.12@sem.tsinghua.edu.cn Yinghui (Catherine) Yang Graduate Schoo of Management
More informationRelational Algebra and SQL. Basic Operations Algebra of Bags
Relational Algebra and SQL Basic Operations Algebra of Bags 1 What is an Algebra Mathematical system consisting of: Operands --- variables or values from which new values can be constructed. Operators
More informationWeek 4. Pointers and Addresses. Dereferencing and initializing. Pointers as Function Parameters. Pointers & Structs. Gaddis: Chapters 9, 11
Week 4 Pointers & Structs Gaddis: Chapters 9, 11 CS 5301 Spring 2017 Ji Seaman 1 Pointers and Addresses The address operator (&) returns the address of a variabe. int x; cout
More informationRelational Algebra. Algebra of Bags
Relational Algebra Basic Operations Algebra of Bags What is an Algebra Mathematical system consisting of: Operands --- variables or values from which new values can be constructed. Operators --- symbols
More informationCBSE SOLVED PAPER 2018 CLASS 11 INFORMATICS RRACTICE OSWAAL BOOKS LEARNING MADE SIMPLE. Strictly as per the Latest NCERT Edition
Stricty as per the Latest NCERT Edition 2018-19 OSWAAL BOOKS LEARNING MADE SIMPLE CBSE FOR MARCH 2019 EXAM SOLVED PAPER 2018 INFORMATICS RRACTICE CLASS 11 Stricty based on the atest CBSE curricuum ISSUED
More informationAuthorization of a QoS Path based on Generic AAA. Leon Gommans, Cees de Laat, Bas van Oudenaarde, Arie Taal
Abstract Authorization of a QoS Path based on Generic Leon Gommans, Cees de Laat, Bas van Oudenaarde, Arie Taa Advanced Internet Research Group, Department of Computer Science, University of Amsterdam.
More informationShape Analysis with Structural Invariant Checkers
Shape Anaysis with Structura Invariant Checkers Bor-Yuh Evan Chang Xavier Riva George C. Necua University of Caifornia, Berkeey SAS 2007 Exampe: Typestate with shape anaysis Concrete Exampe Abstraction
More informationThe University of British Columbia
The Univesity of Bitish Coubia Copute Science 304 Midte Exaination Febuay 5, 2007 Tie: 50 inutes Tota aks: 38 Instucto: Rache Pottinge Nae ANSWER KEY (PRINT) (Last) (Fist) Signatue This exaination has
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 5 Combinational ATPG
Chapter 5 Combinationa ATPG 2 Outine Introduction to ATPG ATPG for Combinationa Circuits Advanced ATPG Techniques 3 Input and Output of an ATPG ATPG (Automatic Test Pattern Generation) Generate a set of
More informationAvaya Aura Call Center Elite Multichannel Configuration Server User Guide
Avaya Aura Ca Center Eite Mutichanne Configuration Server User Guide Reease 6.2.3/6.2.5 March 2013 2013 Avaya Inc. A Rights Reserved. Notice Whie reasonabe efforts were made to ensure that the information
More informationComplex Human Activity Searching in a Video Employing Negative Space Analysis
Compex Human Activity Searching in a Video Empoying Negative Space Anaysis Shah Atiqur Rahman, Siu-Yeung Cho, M.K.H. Leung 3, Schoo of Computer Engineering, Nanyang Technoogica University, Singapore 639798
More informationMeeting Exchange 4.1 Service Pack 2 Release Notes for the S6200/S6800 Servers
Meeting Exchange 4.1 Service Pack 2 Reease Notes for the S6200/S6800 Servers The Meeting Exchange S6200/S6800 Media Servers are SIP-based voice and web conferencing soutions that extend Avaya s conferencing
More informationDXP Digital Communications System 7: :., ; :., Station User s Guide
DXP Digita Communications System 7: :., ; :., Industry-Standard Teephone Station User s Guide This user s guide appies to industry-standard singe-ine teephones such as the mode 2500-** when used with the
More information