CSE132A Solutions HW 1
|
|
|
- Brittany Crawford
- 10 years ago
- Views:
Transcription
1 CSE132A Solutions HW 1 Problem 2. [60pts] Consider the following schema: Suppliers(sid:integer, sname: string, address: string) Parts(pid:integer, pname: string, color: string) Catalog(sid:integer, pid: integer, cost: real) The key fields are underlined, and the domain of each field is listed after the field name. The Catalog relation lists the prices charged for parts by Suppliers. Write the following queries in (a) relational algebra, (b) tuple relational calculus, (c) domain relational calculus and (d) SQL. 1. (3 pts): Find the names of suppliers who supply some red part. π sname (π sid ((π pid σ color= red Parts) Catalog) suppliers) {T :< sname > T1 Suppliers( X Parts(X[color] = red Y Catalog(Y [pid] = X[pid] Y [sid] = T1[sid])) T[sname] = T1[sname]} {Y : sname X Z Suppliers(X, Y, Z) P Q R(Parts(P, Q, R) R = red K Catalog(X, P, K))} S.sname, Parts P, Catalog C P.color= red AND C.pid=P.pid AND C.sid= 2. (3 pts): Find the sids of suppliers who supply some red part or are at 221 Packer Street. π sid ((π pid σ color= red Parts) Catalog) π sidσ address= 221 Packer Str Suppliers {T :< sid > T1 Catalog( X Parts(X[color] = red X[pid] = T1[pid]) T[sid] = T1.sid]) T2 Suppliers(T2[address] = 221 Packer Str T[sid] = T2[sid])} {(X : sid) Y Z Catalog(X, Y, Z) A B (Parts(Y, A, B) B = red ) P Q Suppliers(X, P, Q) Q = 221 Packer Str } 1
2 ( UNION ( S.address = 221 Packer Str ) C.sid Parts P, Catalog C P.color = red AND P.pid = C.pid) 3. (3 pts): Find the sids of suppliers who supply some red part and some green part. π sid ((π pid σ color= red Parts) Catalog) π sid((π pid σ color= green Parts) Catalog) {T :< sid > T1 Catalog( X Parts(X[color] = red X[pid] = T1[pid]) T2 Catalog( Y Parts(Y [color] = green Y [pid] = T2[pid]) T1[sid] = T2[sid] T[sid] = T1[sid]) {S : sid P1 C1 N1 L1(Catalog(S, P1, C1) Parts(P1, N1, L1) L1 = red ) P2 C2 N2 L2(Catalog(S, P2, C2) Parts(P2, N2, L2) L2 = green )} C1.sid Catalog C1, Parts P1, Catalog C2, Parts P2 C1.pid=P1.pid AND P1.color= red AND C2.pid=P2.pid AND P2.color= green AND C1.sid=C2.sid 4. (6 pts): Find the sids of suppliers who supply every part. (π sid,pid (Suppliers Catalog)) (π pid Parts) {T :< sid > S Suppliers P Parts C Catalog (C[sid] = S[sid] P[pid] = C[pid] T[sid] = S[sid])} {(X : sid) SN A Suppliers(X, SN, A) P PN L (Parts(P, PN, L) C Catalog(X, P, C))} ( C.pid Catalog C C.sid = ) CONTAINS ( pid Parts) 5. (6 pts): Find the sids of suppliers who supply every red or green part. (π sid,pid (Suppliers Catalog)) (π pid σ color= red color= green Parts) {T :< sid > S Suppliers P Parts (P[color] = red P[color] = green ) C Catalog (C[sid] = S[sid] P[pid] = C[pid] T[sid] = S[sid])} 2
3 {(X : sid) SN A Suppliers(X, SN, A) P PN L ((Parts(P, PN, L) (L = red L = green )) C Catalog(X, P, C))} ( C.pid Catalog C C.sid = ) CONTAINS ( pid Parts color = red OR color = green ) 6. (6 pts): Find the sids of suppliers who supply every red part or supply every green part. (π sid,pid (Suppliers Catalog)) (π pid σ color= red Parts) (π sid,pid (Suppliers Catalog)) (π pid σ color= green Parts) {T :< sid > S Supp P Parts(P[color] = red C Cat (C[sid] = S[sid] P[pid] = C[pid] T[sid] = S[sid]) S Supp P Parts(P[color] = green C Cat (C[sid] = S[sid] P[pid] = C[pid] T[sid] = S[sid])} {(X : sid) SN A Suppliers(X, SN, A) P PN L ((Parts(P, PN, L) L = red ) C Catalog(X, P, C)) SN A Suppliers(X, SN, A) P PN L ((Parts(P, PN, L) L = green ) C Catalog(X, P, C))} ( UNION ( ( C.pid Catalog C C.sid = ) CONTAINS ( pid Parts color = red )) ( C.pid Catalog C C.sid = ) CONTAINS ( pid Parts color = green )) 7. (9 pts): Find pairs of sids such that the supplier with the first sid charges more for some part than the supplier with the second sid. π sid,sid σ cost>cost (Catalog δ sid,cost sid,cost Catalog) {T :< sid, sid > C Catalog C Catalog C[pid] = C [pid] C[cost] > C [cost] T[sid] = C[sid] T[sid ] = C [sid]} {(S, S ) P C C Catalog(S, P, C) Catalog(S, P, C ) C > C } 3
4 C.sid, C.sid AS sid Catalog C, Catalog C C.pid = C.pid AND C.cost > C.cost 8. (6 pts): Find the pids of parts supplied by at least two different suppliers. π pid σ sid sid (Catalog δ sid,cost sid,cost Catalog) {T :< pid > C Catalog C Catalog C[pid] = C [pid] C[sid] C [sid] T[pid] = C[pid]} {(P) S S C C Catalog(S, P, C) Catalog(S, P, C ) S S } DISTINCT C.pid Catalog C, Catalog C C.pid = C.pid AND C.sid <> C.sid 9. (9 pts): Find the pids of the most expensive parts supplied by suppliers named Yosemite Sham. temp π pid,cost σ sname= Y osemite Sham (Catalog Suppliers) π pid temp \ π pid σ cost<cost (temp δ pid,cost pid,cost temp) } {{ } not most expensive {T :< pid > T1 Catalog( X Suppliers (X.sname = Y osemite Sham X.sid = T1.sid) ( Z Catalog(Z.sid = T1.sid Z.cost > T1.cost))) T[pid] = T1[pid]} {(P : pid) S C Catalog(S, P, C) S N ASuppliers(S, N, A) N = Y osemite Sham ( P C Catalog(S, P, C ) C > C)} CREATE VIEW TEMP(pid,cost) AS C.pid, C.cost Catalog C, C.sid= AND S.sname = Yosemite Sham T.pid TEMP T T.pid NOT IN ( T1.pid TEMP T1, TEMP T2 T1.cost < T2.cost) 10. (9 pts): Find the pids of parts supplied by every supplier at less than $200. (If any supplier either does not supply the part or charges more than $200 for it, the part is not selected). 4
5 TooExpensive π pid σ cost>$200 Catalog SuppliedByAll π pid,sid Catalog π sid Suppliers SuppliedByAll \ T ooexpensive {T :< pid > C Catalog S Supplier C Catalog C [sid] = S[sid] C [pid] = C[pid] ( C Catalog C [pid] = C[pid] C [cost] > $200)} {(P : pid) S C Catalog(S, P, C) S N A Supplier(S, N, A) C Catalog(S, P, C ) ( S C Catalog(S, P, C ) C > $200)} CREATE VIEW TooExpensive AS pid Catalog cost > $200 CREATE VIEW SuppliedByAll AS C.pid Catalog C ( C1.sid Catalog C1 C1.pid = C.pid) CONTAINS ( sid Supplier) pid SuppliedByAll pid NOT IN TooExpensive 5
DATABASE MANAGEMENT SYSTEMS SOLUTIONS MANUAL. Raghu Ramakrishnan et al. University of Wisconsin Madison, WI, USA
DATABASE MANAGEMENT SYSTEMS SOLUTIONS MANUAL Raghu Ramakrishnan et al. University of Wisconsin Madison, WI, USA 2 THE ENTITY-RELATIONSHIP MODEL Exercise 2.1 Explain the following terms briefly: attribute,
DATABASE MANAGEMENT SYSTEMS SOLUTIONS MANUAL. Raghu Ramakrishnan et al. University of Wisconsin Madison, WI, USA
DATABASE MANAGEMENT SYSTEMS SOLUTIONS MANUAL Raghu Ramakrishnan et al. University of Wisconsin Madison, WI, USA CONTENTS PREFACE iii 1 INTRODUCTION TO DATABASE SYSTEMS 1 2 THE ENTITY-RELATIONSHIP MODEL
SQL: QUERIES, CONSTRAINTS, TRIGGERS
5 SQL: QUERIES, CONSTRAINTS, TRIGGERS Online material is available for all exercises in this chapter on the book s webpage at http://www.cs.wisc.edu/~dbbook This includes scripts to create tables for each
Proposed solutions Project Assignment #1 (SQL)
Proposed solutions Project Assignment #1 (SQL) (a) Database creation: create table sailor (sname CHAR(30), rating INTEGER) create table boat (bname CHAR (30), color CHAR (15), rating INTEGER) create table
Chapter 5. SQL: Queries, Constraints, Triggers
Chapter 5 SQL: Queries, Constraints, Triggers 1 Overview: aspects of SQL DML: Data Management Language. Pose queries (Ch. 5) and insert, delete, modify rows (Ch. 3) DDL: Data Definition Language. Creation,
Relational Algebra and SQL
Relational Algebra and SQL Johannes Gehrke [email protected] http://www.cs.cornell.edu/johannes Slides from Database Management Systems, 3 rd Edition, Ramakrishnan and Gehrke. Database Management
SQL: Queries, Programming, Triggers
SQL: Queries, Programming, Triggers Chapter 5 Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 R1 Example Instances We will use these instances of the Sailors and Reserves relations in
Example Instances. SQL: Queries, Programming, Triggers. Conceptual Evaluation Strategy. Basic SQL Query. A Note on Range Variables
SQL: Queries, Programming, Triggers Chapter 5 Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Example Instances We will use these instances of the Sailors and Reserves relations in our
SQL: Queries, Programming, Triggers
SQL: Queries, Programming, Triggers CSC343 Introduction to Databases - A. Vaisman 1 R1 Example Instances We will use these instances of the Sailors and Reserves relations in our examples. If the key for
Relational Algebra. Module 3, Lecture 1. Database Management Systems, R. Ramakrishnan 1
Relational Algebra Module 3, Lecture 1 Database Management Systems, R. Ramakrishnan 1 Relational Query Languages Query languages: Allow manipulation and retrieval of data from a database. Relational model
Introduction to Microsoft Jet SQL
Introduction to Microsoft Jet SQL Microsoft Jet SQL is a relational database language based on the SQL 1989 standard of the American Standards Institute (ANSI). Microsoft Jet SQL contains two kinds of
Boats bid bname color 101 Interlake blue 102 Interlake red 103 Clipper green 104 Marine red. Figure 1: Instances of Sailors, Boats and Reserves
Tutorial 5: SQL By Chaofa Gao Tables used in this note: Sailors(sid: integer, sname: string, rating: integer, age: real); Boats(bid: integer, bname: string, color: string); Reserves(sid: integer, bid:
DATABASE MANAGEMENT SYSTEMS SOLUTIONS MANUAL THIRD EDITION
DATABASE MANAGEMENT SYSTEMS SOLUTIONS MANUAL THIRD EDITION Raghu Ramakrishnan University of Wisconsin Madison, WI, USA Johannes Gehrke Cornell University Ithaca, NY, USA Jeff Derstadt, Scott Selikoff,
6 QUERY-BY-EXAMPLE (QBE)
6 QUERY-BY-EXAMPLE (QBE) Example is always more efficacious than precept. Samuel Johnson 6.1 INTRODUCTION Query-by-Example (QBE) is another language for querying (and, like SQL, for creating and modifying)
3. Relational Model and Relational Algebra
ECS-165A WQ 11 36 3. Relational Model and Relational Algebra Contents Fundamental Concepts of the Relational Model Integrity Constraints Translation ER schema Relational Database Schema Relational Algebra
Databases and BigData
Eduardo Cunha de Almeida [email protected] Outline of the course Introduction Database Systems (E. Almeida) Distributed Hash Tables and P2P (C. Cassagnes) NewSQL (D. Kim and J. Meira) NoSQL (D. Kim)
Lecture 6. SQL, Logical DB Design
Lecture 6 SQL, Logical DB Design Relational Query Languages A major strength of the relational model: supports simple, powerful querying of data. Queries can be written intuitively, and the DBMS is responsible
CMU - SCS 15-415/15-615 Database Applications Spring 2013, C. Faloutsos Homework 1: E.R. + Formal Q.L. Deadline: 1:30pm on Tuesday, 2/5/2013
CMU - SCS 15-415/15-615 Database Applications Spring 2013, C. Faloutsos Homework 1: E.R. + Formal Q.L. Deadline: 1:30pm on Tuesday, 2/5/2013 Reminders - IMPORTANT: Like all homeworks, it has to be done
1. SELECT DISTINCT f.fname FROM Faculty f, Class c WHERE f.fid = c.fid AND c.room = LWSN1106
Database schema: Department(deptid, dname, location) Student(snum, sname, deptid, slevel, age) Faculty(fid, fname, deptid) Class(cname, time, room, fid) Enrolled(snum, cname) SQL queries: 1. Get the names
LABSHEET 1: creating a table, primary keys and data types
LABSHEET 1: creating a table, primary keys and data types Before you begin, you may want to take a look at the following links to remind yourself of the basics of MySQL and the SQL language. MySQL 5.7
Database Management Systems. Chapter 1
Database Management Systems Chapter 1 Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 2 What Is a Database/DBMS? A very large, integrated collection of data. Models real-world scenarios
Overview of Database Management Systems
Overview of Database Management Systems Goals: DBMS basic concepts Introduce underlying managerial issues Prepare for discussion of uses of DBMS, such as OLAP and database mining 1 Overview of Database
The Relational Model. Why Study the Relational Model?
The Relational Model Chapter 3 Instructor: Vladimir Zadorozhny [email protected] Information Science Program School of Information Sciences, University of Pittsburgh 1 Why Study the Relational Model?
CS GATE Paper 2009 www.gateforum.com
Q. No. 0 Carry One Mark Each. Which one of the following in NOT necessarily a property of a Group? (A) Commutativity (B) Associativity (C) Existence of inverse for every element (D) Existence of identity.
The Relational Model. Ramakrishnan&Gehrke, Chapter 3 CS4320 1
The Relational Model Ramakrishnan&Gehrke, Chapter 3 CS4320 1 Why Study the Relational Model? Most widely used model. Vendors: IBM, Informix, Microsoft, Oracle, Sybase, etc. Legacy systems in older models
Review: Participation Constraints
Review: Participation Constraints Does every department have a manager? If so, this is a participation constraint: the participation of Departments in Manages is said to be total (vs. partial). Every did
Information Systems SQL. Nikolaj Popov
Information Systems SQL Nikolaj Popov Research Institute for Symbolic Computation Johannes Kepler University of Linz, Austria [email protected] Outline SQL Table Creation Populating and Modifying
The Relational Model. Why Study the Relational Model? Relational Database: Definitions. Chapter 3
The Relational Model Chapter 3 Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Why Study the Relational Model? Most widely used model. Vendors: IBM, Informix, Microsoft, Oracle, Sybase,
CS 338 Join, Aggregate and Group SQL Queries
CS 338 Join, Aggregate and Group SQL Queries Bojana Bislimovska Winter 2016 Outline SQL joins Aggregate functions in SQL Grouping in SQL HAVING clause SQL Joins Specifies a table resulting from a join
COMP 5138 Relational Database Management Systems. Week 5 : Basic SQL. Today s Agenda. Overview. Basic SQL Queries. Joins Queries
COMP 5138 Relational Database Management Systems Week 5 : Basic COMP5138 "Relational Database Managment Systems" J. Davis 2006 5-1 Today s Agenda Overview Basic Queries Joins Queries Aggregate Functions
Θεµελίωση Βάσεων εδοµένων
Θεµελίωση Βάσεων εδοµένων Βασίλης Βασσάλος 1 What do we need to produce good software? Good programmers, software engineers, project managers, business experts, etc. (People) Good software development
Answer Key. UNIVERSITY OF CALIFORNIA College of Engineering Department of EECS, Computer Science Division
Answer Key UNIVERSITY OF CALIFORNIA College of Engineering Department of EECS, Computer Science Division CS186 Fall 2003 Eben Haber Midterm Midterm Exam: Introduction to Database Systems This exam has
4. SQL. Contents. Example Database. CUSTOMERS(FName, LName, CAddress, Account) PRODUCTS(Prodname, Category) SUPPLIERS(SName, SAddress, Chain)
ECS-165A WQ 11 66 4. SQL Contents Basic Queries in SQL (select statement) Set Operations on Relations Nested Queries Null Values Aggregate Functions and Grouping Data Definition Language Constructs Insert,
1. Write the query of Exercise 6.19 using TRC and DRC: Find the names of all brokers who have made money in all accounts assigned to them.
1. Write the query of Exercise 6.19 using TRC and DRC: Find the names of all brokers who have made money in all accounts assigned to them. TRC: DRC: {B.Name Broker(B) AND A Account (A.BrokerId = B.Id A.Gain
CS2Bh: Current Technologies. Introduction to XML and Relational Databases. The Relational Model. The relational model
CS2Bh: Current Technologies Introduction to XML and Relational Databases Spring 2005 The Relational Model CS2 Spring 2005 (LN6) 1 The relational model Proposed by Codd in 1970. It is the dominant data
Database Security. Chapter 21
Database Security Chapter 21 Introduction to DB Security Secrecy: Users should not be able to see things they are not supposed to. E.g., A student can t see other students grades. Integrity: Users should
History of SQL. Relational Database Languages. Tuple relational calculus ALPHA (Codd, 1970s) QUEL (based on ALPHA) Datalog (rule-based, like PROLOG)
Relational Database Languages Tuple relational calculus ALPHA (Codd, 1970s) QUEL (based on ALPHA) Datalog (rule-based, like PROLOG) Domain relational calculus QBE (used in Access) History of SQL Standards:
How To Improve Performance In A Database
Some issues on Conceptual Modeling and NoSQL/Big Data Tok Wang Ling National University of Singapore 1 Database Models File system - field, record, fixed length record Hierarchical Model (IMS) - fixed
SQL Simple Queries. Chapter 3.1 V3.0. Copyright @ Napier University Dr Gordon Russell
SQL Simple Queries Chapter 3.1 V3.0 Copyright @ Napier University Dr Gordon Russell Introduction SQL is the Structured Query Language It is used to interact with the DBMS SQL can Create Schemas in the
DataBase Management Systems Lecture Notes
1 SHRI VISHNU ENGINEERING COLLEGE FOR WOMEN::BHIMAVARAM DEPARTMENT OF INFORMATION TECHNOLOGY DataBase Management Systems Lecture Notes UNIT-1 Data: It is a collection of information. The facts that can
The core theory of relational databases. Bibliography
The core theory of relational databases Slide 1 La meilleure pratique... c est une bonne théorie Bibliography M.Levene, G.Loizou, Guided Tour of Relational Databases and Beyond, Springer, 625 pages,1999.
CS2Bh: Current Technologies. Introduction to XML and Relational Databases. Introduction to Databases. Why databases? Why not use XML?
CS2Bh: Current Technologies Introduction to XML and Relational Databases Spring 2005 Introduction to Databases CS2 Spring 2005 (LN5) 1 Why databases? Why not use XML? What is missing from XML: Consistency
LiTH, Tekniska högskolan vid Linköpings universitet 1(7) IDA, Institutionen för datavetenskap Juha Takkinen 2007-05-24
LiTH, Tekniska högskolan vid Linköpings universitet 1(7) IDA, Institutionen för datavetenskap Juha Takkinen 2007-05-24 1. A database schema is a. the state of the db b. a description of the db using a
Data Modeling. Database Systems: The Complete Book Ch. 4.1-4.5, 7.1-7.4
Data Modeling Database Systems: The Complete Book Ch. 4.1-4.5, 7.1-7.4 Data Modeling Schema: The structure of the data Structured Data: Relational, XML-DTD, etc Unstructured Data: CSV, JSON But where does
types, but key declarations and constraints Similar CREATE X commands for other schema ëdrop X name" deletes the created element of beer VARCHARè20è,
Dening a Database Schema CREATE TABLE name èlist of elementsè. Principal elements are attributes and their types, but key declarations and constraints also appear. Similar CREATE X commands for other schema
Querying Combined Cloud-Based and Relational Databases
Querying Combined Cloud-Based and Relational Databases Minpeng Zhu and Tore Risch Department of Information Technology, Uppsala University, Sweden [email protected] [email protected] Abstract An increasing
Exercise 1: Relational Model
Exercise 1: Relational Model 1. Consider the relational database of next relational schema with 3 relations. What are the best possible primary keys in each relation? employ(person_name, street, city)
Databases 2011 The Relational Model and SQL
Databases 2011 Christian S. Jensen Computer Science, Aarhus University What is a Database? Main Entry: da ta base Pronunciation: \ˈdā-tə-ˌbās, ˈda- also ˈdä-\ Function: noun Date: circa 1962 : a usually
2. Basic Relational Data Model
2. Basic Relational Data Model 2.1 Introduction Basic concepts of information models, their realisation in databases comprising data objects and object relationships, and their management by DBMS s that
Object Oriented Databases (OODBs) Relational and OO data models. Advantages and Disadvantages of OO as compared with relational
Object Oriented Databases (OODBs) Relational and OO data models. Advantages and Disadvantages of OO as compared with relational databases. 1 A Database of Students and Modules Student Student Number {PK}
Database Sample Examination
Part 1: SQL Database Sample Examination (Spring 2007) Question 1: Draw a simple ER diagram that results in a primary key/foreign key constraint to be created between the tables: CREATE TABLE Salespersons
TYPICAL QUESTIONS & ANSWERS
PART-I TYPICAL QUESTIONS & ANSWERS OBJECTIVE TYPE QUESTIONS Each question carries 2 marks. Choose the correct or best alternative in the following: Q.1 In the relational modes, cardinality is termed as:
More on SQL. Juliana Freire. Some slides adapted from J. Ullman, L. Delcambre, R. Ramakrishnan, G. Lindstrom and Silberschatz, Korth and Sudarshan
More on SQL Some slides adapted from J. Ullman, L. Delcambre, R. Ramakrishnan, G. Lindstrom and Silberschatz, Korth and Sudarshan SELECT A1, A2,, Am FROM R1, R2,, Rn WHERE C1, C2,, Ck Interpreting a Query
Comp 3311 Database Management Systems. 2. Relational Model Exercises
Comp 3311 Database Management Systems 2. Relational Model Exercises 1 E-R Diagram for a Banking Enterprise 2 Tables for ER diagram Entities Branch (branch-name, branch-city, assets) Customer (customer-id,
Database Application Development. Overview. SQL in Application Code. Chapter 6
Database Application Development Chapter 6 Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Overview Concepts covered in this lecture: SQL in application code Embedded SQL Cursors Dynamic
2. Conceptual Modeling using the Entity-Relationship Model
ECS-165A WQ 11 15 Contents 2. Conceptual Modeling using the Entity-Relationship Model Basic concepts: entities and entity types, attributes and keys, relationships and relationship types Entity-Relationship
Overview. Database Application Development. SQL in Application Code (Contd.) SQL in Application Code. Embedded SQL. Embedded SQL: Variables
Overview Database Application Development Chapter 6 Concepts covered in this lecture: SQL in application code Embedded SQL Cursors Dynamic SQL JDBC SQLJ Stored procedures Database Management Systems 3ed,
D B M G Data Base and Data Mining Group of Politecnico di Torino
Database Management Data Base and Data Mining Group of [email protected] A.A. 2014-2015 Optimizer objective A SQL statement can be executed in many different ways The query optimizer determines
Database Management Systems,
Database Management Systems Database Design Example 1 Topics Hospital Database E-R Design Entities Relationships Converting E-R Model to Relational Model Tables Queries Company Database Summary 2 Hospital
The Relational Data Model and Relational Database Constraints
The Relational Data Model and Relational Database Constraints Chapter Outline Relational Model Concepts Relational Model Constraints and Relational Database Schemas Update Operations and Dealing with Constraint
There are five fields or columns, with names and types as shown above.
3 THE RELATIONAL MODEL Exercise 3.1 Define the following terms: relation schema, relational database schema, domain, attribute, attribute domain, relation instance, relation cardinality, andrelation degree.
Elena Baralis, Silvia Chiusano Politecnico di Torino. Pag. 1. Active database systems. Triggers. Triggers. Active database systems.
Active database systems Database Management Systems Traditional DBMS operation is passive Queries and updates are explicitly requested by users The knowledge of processes operating on data is typically
Review Entity-Relationship Diagrams and the Relational Model. Data Models. Review. Why Study the Relational Model? Steps in Database Design
Review Entity-Relationship Diagrams and the Relational Model CS 186, Fall 2007, Lecture 2 R & G, Chaps. 2&3 Why use a DBMS? OS provides RAM and disk A relationship, I think, is like a shark, you know?
Advance DBMS. Structured Query Language (SQL)
Structured Query Language (SQL) Introduction Commercial database systems use more user friendly language to specify the queries. SQL is the most influential commercially marketed product language. Other
Introduction to Databases
Page 1 of 5 Introduction to Databases An introductory example What is a database? Why do we need Database Management Systems? The three levels of data abstraction What is a Database Management System?
The Relational Model. Why Study the Relational Model? Relational Database: Definitions
The Relational Model Database Management Systems, R. Ramakrishnan and J. Gehrke 1 Why Study the Relational Model? Most widely used model. Vendors: IBM, Microsoft, Oracle, Sybase, etc. Legacy systems in
ECS 165A: Introduction to Database Systems
ECS 165A: Introduction to Database Systems Todd J. Green based on material and slides by Michael Gertz and Bertram Ludäscher Winter 2011 Dept. of Computer Science UC Davis ECS-165A WQ 11 1 1. Introduction
DATA CUBES E0 261. Jayant Haritsa Computer Science and Automation Indian Institute of Science. JAN 2014 Slide 1 DATA CUBES
E0 261 Jayant Haritsa Computer Science and Automation Indian Institute of Science JAN 2014 Slide 1 Introduction Increasingly, organizations are analyzing historical data to identify useful patterns and
Migrate Topaz databases from One Server to Another
Title Migrate Topaz databases from One Server to Another Author: Olivier Lauret Date: November 2004 Modified: Category: Topaz/BAC Version: Topaz 4.5.2, BAC 5.0 and BAC 5.1 Migrate Topaz databases from
10CS54: DATABASE MANAGEMENT SYSTEM
CS54: DATABASE MANAGEMENT SYSTEM QUESTION BANK Chapter 1: Introduction to Database Systems Objective: Databases and data base system have become an essential component of everyday life in modern society.
Lab Manual. Database Systems COT-313 & Database Management Systems Lab IT-216
Lab Manual Database Systems COT-313 & Database Management Systems Lab IT-216 Lab Instructions Several practicals / programs? Whether an experiment contains one or several practicals /programs One practical
Relational Database: Additional Operations on Relations; SQL
Relational Database: Additional Operations on Relations; SQL Greg Plaxton Theory in Programming Practice, Fall 2005 Department of Computer Science University of Texas at Austin Overview The course packet
Secure Cooperative Data Access in Multi-Cloud Environment
Mason Archival Repository Service http://mars.gmu.edu etd @ Mason (Electronic Theses and Dissertations) The Volgenau School of Engineering 2013 Secure Cooperative Data Access in Multi-Cloud Environment
Managing E-Commerce Catalogs in a DBMS with Native XML Support
Managing E-Commerce Catalogs in a DBMS with Native XML Support Lipyeow Lim IBM T.J. Watson Research Center 19 Skyline Drive, Hawthorne, NY 10532 [email protected] Min Wang IBM T.J. Watson Research Center
CSE 562 Database Systems
UB CSE Database Courses CSE 562 Database Systems CSE 462 Database Concepts Introduction CSE 562 Database Systems Some slides are based or modified from originals by Database Systems: The Complete Book,
CSE 544 Principles of Database Management Systems. Magdalena Balazinska Fall 2007 Lecture 16 - Data Warehousing
CSE 544 Principles of Database Management Systems Magdalena Balazinska Fall 2007 Lecture 16 - Data Warehousing Class Projects Class projects are going very well! Project presentations: 15 minutes On Wednesday
UNIT 6. Structured Query Language (SQL) Text: Chapter 5
UNIT 6 Structured Query Language (SQL) Text: Chapter 5 Learning Goals Given a database (a set of tables ) you will be able to express a query in SQL, involving set operators, subqueries and aggregations
Online shopping cart. Tarik Guelzim Graduate school of computer science at Monmouth University. CS517 Database management systems Project 2
Tarik Guelzim Graduate school of computer science at Monmouth University CS517 Database management systems Project 2 Page 1 of 9 Database Schema Page 2 of 9 Table name Indexed fields reason Page 3 of 9
TAP into NAU. TAP is a single tool. How it works. Transfer Academic Plan nau.edu/tap
TAP into and an degree: the catalog TAP into and an degree: the catalog TAP into and an degree: the catalog TAP into and an degree: the catalog TAP into and an degree: the catalog TAP into and an degree:
www.gr8ambitionz.com
Data Base Management Systems (DBMS) Study Material (Objective Type questions with Answers) Shared by Akhil Arora Powered by www. your A to Z competitive exam guide Database Objective type questions Q.1
CS54100: Database Systems
CS54100: Database Systems Date Warehousing: Current, Future? 20 April 2012 Prof. Chris Clifton Data Warehousing: Goals OLAP vs OLTP On Line Analytical Processing (vs. Transaction) Optimize for read, not
Relational model. Relational model - practice. Relational Database Definitions 9/27/11. Relational model. Relational Database: Terminology
COS 597A: Principles of Database and Information Systems elational model elational model A formal (mathematical) model to represent objects (data/information), relationships between objects Constraints
SQL Database queries and their equivalence to predicate calculus
SQL Database queries and their equivalence to predicate calculus Russell Impagliazzo, with assistence from Cameron Helm November 3, 2013 1 Warning This lecture goes somewhat beyond Russell s expertise,
Using Temporary Tables to Improve Performance for SQL Data Services
Using Temporary Tables to Improve Performance for SQL Data Services 2014- Informatica Corporation. No part of this document may be reproduced or transmitted in any form, by any means (electronic, photocopying,
Mini User's Guide for SQL*Plus T. J. Teorey
Mini User's Guide for SQL*Plus T. J. Teorey Table of Contents Oracle/logging-in 1 Nested subqueries 5 SQL create table/naming rules 2 Complex functions 6 Update commands 3 Save a query/perm table 6 Select
Chapter 10. Functional Dependencies and Normalization for Relational Databases. Copyright 2007 Ramez Elmasri and Shamkant B.
Chapter 10 Functional Dependencies and Normalization for Relational Databases Copyright 2007 Ramez Elmasri and Shamkant B. Navathe Chapter Outline 1 Informal Design Guidelines for Relational Databases
Decision Support. Chapter 23. Database Management Systems, 2 nd Edition. R. Ramakrishnan and J. Gehrke 1
Decision Support Chapter 23 Database Management Systems, 2 nd Edition. R. Ramakrishnan and J. Gehrke 1 Introduction Increasingly, organizations are analyzing current and historical data to identify useful
Summary on Chapter 4 Basic SQL
Summary on Chapter 4 Basic SQL SQL Features Basic SQL DDL o Includes the CREATE statements o Has a comprehensive set of SQL data types o Can specify key, referential integrity, and other constraints Basic
Introduction to SQL: Data Retrieving
Introduction to SQL: Data Retrieving Ruslan Fomkin Databasdesign för Ingenjörer 1056F Structured Query Language (SQL) History: SEQUEL (Structured English QUery Language), earlier 70 s, IBM Research SQL
Bridge from Entity Relationship modeling to creating SQL databases, tables, & relations
1 Topics for this week: 1. Good Design 2. Functional Dependencies 3. Normalization Readings for this week: 1. E&N, Ch. 10.1-10.6; 12.2 2. Quickstart, Ch. 3 3. Complete the tutorial at http://sqlcourse2.com/
Relational Algebra. Query Languages Review. Operators. Select (σ), Project (π), Union ( ), Difference (-), Join: Natural (*) and Theta ( )
Query Languages Review Relational Algebra SQL Set operators Union Intersection Difference Cartesian product Relational Algebra Operators Relational operators Selection Projection Join Division Douglas
CSE 132A. Database Systems Principles
CSE 132A Database Systems Principles Prof. Victor Vianu 1 Data Management An evolving, expanding field: Classical stand-alone databases (Oracle, DB2, SQL Server) Computer science is becoming data-centric:
CA ERwin Data Modeler. ODBC Reporting Guide
CA ERwin Data Modeler ODBC Reporting Guide r8 This documentation, which includes embedded help systems and electronically distributed materials, (hereinafter referred to as the Documentation ) is for your
CS143 Notes: Views & Authorization
CS143 Notes: Views & Authorization Book Chapters (4th) Chapter 4.7, 6.5-6 (5th) Chapter 4.2, 8.6 (6th) Chapter 4.4, 5.3 Views What is a view? A virtual table created on top of other real tables Almost
Programming in postgresql with PL/pgSQL. Procedural Language extension to postgresql
Programming in postgresql with PL/pgSQL Procedural Language extension to postgresql 1 Why a Programming Language? Some calculations cannot be made within a query (examples?) Two options: Write a program
