Other Query Languages. Winter Lecture 11
|
|
- Lee Porter
- 6 years ago
- Views:
Transcription
1 Other Query Languages Winter Lecture 11
2 Query Languages Previously covered relational algebra A procedural query language Foundation of the Structured Query Language (SQL) Supports wide variety of queries, inserts, updates, deletes Two other formal query languages: Tuple relational calculus Domain relational calculus Two language implementations based on relational calculus Nowhere near the popularity of SQL, though
3 Tuple Relational Calculus Entirely declarative! Queries have the form: { t P(t) } The set of all tuples t, such that P(t) is true As before, t[a] refers to t s value for attribute A Example query: Find the branch name, loan number, and amount of all loans over $1200. { t t loan t[amount] > 1200 } The set of all tuples t, such that t appears in the loan relation, and t s amount is over $1200. Schema has same attributes that loan relation has.
4 Selecting Loan Numbers If we only want loan numbers: Schema of t should be (loan_number) But, now t doesn t appear in loan relation Introduce another tuple variable: s loan Updated query: { t s loan ( t[loan_number] = s[loan_number] s[amount] > 1200 ) } The set of all tuples t, such that there exists a tuple s in the loan relation with the same loan number as t, and a balance of more than $1200. No relation associated with t, and only loan_number attribute is referenced.
5 Joining Relations Another query: Find names of all customers with a loan from the Perryridge branch. Relations: loan(loan_number, branch_name, amount) borrower(customer_name, loan_number) Need to join relations together to compute the result Join loan and borrower using loan_number Use tuple variables to specify join constraints
6 Joining Relations (2) Query: { t s borrower ( t[customer_name] = s[customer_name] u loan ( u[loan_number] = s[loan_number] u[branch_name] = Perryridge )) } The set of all tuples t, such that t refers to a valid borrower name, and the borrower has at least one loan at the Perryridge branch. Use var relation to perform join and subquery kinds of operations Tuple variables s, u allow the borrower and loan relations to be correlated with each other, and with t
7 Set Operations Set operations are easy in the tuple relational calculus Example: Find all customers that have an account or a loan. In relational algebra, used set-union operation: ( In tuple relational calculus: { t s borrower ( t[customer_name] = s[customer_name] ) u depositor ( t[customer_name] = u[customer_name] ) } This defines a relation, so if customer is in borrower and depositor, they only appear once in result.
8 Set Operations (2) Find customers with both an account and a loan. Just change to : { t s borrower ( t[customer_name] = s[customer_name] ) u depositor ( t[customer_name] = u[customer_name] ) } Find customers with an account but not a loan. Again, very simple to construct: { t s depositor (t[customer_name] = s[customer_name]) Ÿ u borrower (t[customer_name] = u[customer_name]) } Result contains customer names that appear in depositor relation, but not in borrower relation
9 For All Queries Another query: Find all customers who have an account at all branches located in Brooklyn. In relational algebra, used divide operation In tuple relational calculus, can use for this t r (Q(t)) Q is true for all tuples t in relation r. Can also use implication: P Q means Q ŸP
10 For All Queries (2) Query: { t r customer ( r[customer_name] = t[customer_name] ) u branch ( u[branch_city] = Brooklyn s depositor ( t[customer_name] = s[customer_name] w account ( w[account_number] = s[account_number] w[branch_name] = u[branch_name] )))) } The set of all customer names, such that for all branches located in Brooklyn, there exists a tuple in depositor for that customer with a corresponding account located at that branch. What if there are no branches in Brooklyn? Must restrict result to only valid customer names
11 Formal Definitions Expressions are of the form { t P(t) } P is some formula Can contain tuple variables A tuple variable is said to be free if not quantified by or Tuple variables constrained by or are bound Example: t loan s branch ( t[branch_name] = s[branch_name] ) t is a free tuple variable s is a bound tuple variable
12 Formal Definitions (2) Formulas are built out of atoms Valid atoms: s r ( not allowed) s[x] Θ u[y] Comparison of two attributes Θ is a comparison operator: < = > s[x] Θ c Comparison to some constant value Any atom is also a formula
13 Formal Definitions (3) Compositions of atoms: If P 1 is a formula, then so are ŸP 1 and (P 1 ) If P 1 and P 2 are formulae, then so are: P 1 P 2 P 1 P 2 P 1 P 2 If P 1 (s) is a formula containing a free tuple variable s, and r is a relation, then so are: s r (P 1 (s)) s r (P 1 (s))
14 Safety of Expressions Does tuple relational calculus have any issues? Yes: Can write an expression that generates an infinite relation! { t Ÿ(t loan) } Result contains an infinite set of tuples Such expressions are said to be unsafe Must constrain ourselves to safe expressions Define rules to indicate what expressions are safe
15 Safety of Expressions (2) Every tuple relational formula P has a domain The set of all values referenced by P Includes values explicitly stated in P Also includes values in relations used in P Denoted as dom(p) Example: dom(t loan t[amount] > 1200) Set containing 1200, and all values appearing in loan An expression { t P(t) } is safe if all values in result are also in dom(p) { t Ÿ(t loan) } is not safe because it contains values outside of loan relation
16 Tuple Relational Calculus Same expressive power as relational algebra, when limited to safe expressions Doesn t have extended relational operators Purely declarative nature makes it more appealing, in some ways Can unsafe expressions be written in relational algebra? No! Operations generate results only from tuples in existing relations.
17 Datalog Datalog is a query language based on relational calculus Based on logic-programming language Prolog Syntax is very similar to Prolog Datalog is purely declarative Programs consist of a set of rules Order is irrelevant Specific constraints are enforced to ensure only safe expressions Largely constrained to research project usage
18 Example Datalog Statements A rule to produce account numbers and balances for accounts at Perryridge branch with a balance over $700 v1(a, B) :- account(a, Perryridge, B), B > 700 account(account_number, branch_name, balance) Can be read as: for all A, B if (A, Perryridge, B) account and B > 700 then (A, B) v1 Defines a view relation v1 is a view that references account relation
19 Example Datalog Statements (2) Can issue queries against v1 To find balance of account A-217:? v1( A-217, B) Produces ( A-217, 750) To find accounts with a balance over $800? v1(a, B), B > 800 for all A, B if (A, B) v1 and B > 800 then (A, B) is in the result Produces one result: ( A-201, 900) Variables and values are positional Attribute names are omitted
20 Example Datalog Statements (3) Often need multiple rules to define view relation Example: Define a view relation that specifies the interest rate for every account. interest_rate(a, 5) :- account(a, N, B), B < interest_rate(a, 6) :- account(a, N, B), B >= Accounts with a balance of less than $10,000 have a 5% interest rate Accounts with a balance of $10,000 or more have an interest rate of 6%
21 Relational Operations in Datalog Cartesian product of r 1 and r 2 : query(x 1,, X n, Y 1,, Y m ) :- r 1 (X 1,, X n ), r 2 (Y 1, Y m ) Set union of r 1 and r 2 : query(x 1,, X n ) :- r 1 (X 1,, X n ) query(x 1,, X n ) :- r 2 (X 1,, X n ) Set difference of r 1 and r 2 : query(x 1,, X n ) :- r 1 (X 1,, X n ), not r 2 (X 1,, X n )
22 Recursive Datalog Datalog also has recursive query capabilities Powerful mechanism for navigating hierarchical data Example: Define a view relation for all employees directly or indirectly managed by a particular manager. empl(x, Y) :- manager(x, Y) empl(x, Y) :- manager(x, Z), empl(z, Y) To find all employees managed by Jones: empl(x, Jones )
23 Datalog Summary Datalog provides very succinct statement of queries Declarative nature facilitates optimized execution Features like recursive queries are very powerful Similar concept being incorporated into SQL Unfortunately relegated primarily to research use
Other Query Languages II. Winter Lecture 12
Other Query Languages II Winter 2006-2007 Lecture 12 Last Lecture Previously discussed tuple relational calculus Purely declarative query language Same expressive power as relational algebra Could also
More informationChapter 3: SQL. Chapter 3: SQL
Chapter 3: SQL Database System Concepts, 5th Ed. See www.db-book.com for conditions on re-use Chapter 3: SQL Data Definition Basic Query Structure Set Operations Aggregate Functions Null Values Nested
More informationChapter 3: SQL. Database System Concepts, 5th Ed. Silberschatz, Korth and Sudarshan See for conditions on re-use
Chapter 3: SQL Database System Concepts, 5th Ed. See www.db-book.com for conditions on re-use Chapter 3: SQL Data Definition Basic Query Structure Set Operations Aggregate Functions Null Values Nested
More informationSilberschatz, Korth and Sudarshan See for conditions on re-use
Chapter 3: SQL Database System Concepts, 5th Ed. See www.db-book.com for conditions on re-use Chapter 3: SQL Data Definition Basic Query Structure Set Operations Aggregate Functions Null Values Nested
More informationCSIE30600/CSIEB0290 Database Systems Relational Algebra and Calculus 2
Outline Relational Algebra Unary Relational Operations Relational Algebra Operations From Set Theory Binary Relational Operations Additional Relational Operations Examples of Queries in Relational Algebra
More informationChapter 5: Other Relational Languages.! Query-by-Example (QBE)! Datalog
Chapter 5: Other Relational Languages! Query-by-Example (QBE)! Datalog 5.1 Query-by by-example (QBE)! Basic Structure! Queries on One Relation! Queries on Several Relations! The Condition Box! The Result
More informationOutline. CSIE30600 Database Systems Relational Algebra and Calculus 2
Outline Relational Algebra Unary Relational Operations Relational Algebra Operations From Set Theory Binary Relational Operations Additional Relational Operations Examples of Queries in Relational Algebra
More informationDatabase System Concepts, 5th Ed.! Silberschatz, Korth and Sudarshan See for conditions on re-use "
Database System Concepts, 5th Ed.! Silberschatz, Korth and Sudarshan See www.db-book.com for conditions on re-use " Data Definition! Basic Query Structure! Set Operations! Aggregate Functions! Null Values!
More informationChapter 5: Other Relational Languages
Chapter 5: Other Relational Languages Database System Concepts, 5th Ed. See www.db-book.com for conditions on re-use Chapter 5: Other Relational Languages Tuple Relational Calculus Domain Relational Calculus
More informationDATABASE DESIGN I - 1DL300
DATABASE DESIGN I - 1DL300 Fall 2010 An introductory course on database systems http://www.it.uu.se/edu/course/homepage/dbastekn/ht10/ Manivasakan Sabesan Uppsala Database Laboratory Department of Information
More informationDATABASE TECHNOLOGY. Spring An introduction to database systems
1 DATABASE TECHNOLOGY Spring 2007 An introduction to database systems Kjell Orsborn Uppsala Database Laboratory Department of Information Technology, Uppsala University, Uppsala, Sweden 2 Introduction
More informationChapter 2: Relational Model
Chapter 2: Relational Model Database System Concepts, 5 th Ed. See www.db-book.com for conditions on re-use Chapter 2: Relational Model Structure of Relational Databases Fundamental Relational-Algebra-Operations
More informationDatabase System Concepts, 5 th Ed.! Silberschatz, Korth and Sudarshan See for conditions on re-use "
Database System Concepts, 5 th Ed.! Silberschatz, Korth and Sudarshan See www.db-book.com for conditions on re-use " Structure of Relational Databases! Fundamental Relational-Algebra-Operations! Additional
More informationChapter 3: Relational Model
Chapter 3: Relational Model Structure of Relational Databases Relational Algebra Tuple Relational Calculus Domain Relational Calculus Extended Relational-Algebra-Operations Modification of the Database
More informationCS34800 Information Systems. The Relational Model Prof. Walid Aref 29 August, 2016
CS34800 Information Systems The Relational Model Prof. Walid Aref 29 August, 2016 1 Chapter: The Relational Model Structure of Relational Databases Relational Algebra Tuple Relational Calculus Domain Relational
More informationOther Relational Query Languages
APPENDIXC Other Relational Query Languages In Chapter 6 we presented the relational algebra, which forms the basis of the widely used SQL query language. SQL was covered in great detail in Chapters 3 and
More informationChapter 6: Formal Relational Query Languages
Chapter 6: Formal Relational Query Languages Database System Concepts, 6 th Ed. See www.db-book.com for conditions on re-use Chapter 6: Formal Relational Query Languages Relational Algebra Tuple Relational
More informationSimple SQL Queries (2)
Simple SQL Queries (2) Review SQL the structured query language for relational databases DDL: data definition language DML: data manipulation language Create and maintain tables CMPT 354: Database I --
More informationDatabase System Concepts, 5th Ed.! Silberschatz, Korth and Sudarshan See for conditions on re-use "
Database System Concepts, 5th Ed.! Silberschatz, Korth and Sudarshan See www.db-book.com for conditions on re-use " Data Definition! Basic Query Structure! Set Operations! Aggregate Functions! Null Values!
More informationUpon completion of this Unit, students will be introduced to the following
Instructional Objectives Upon completion of this Unit, students will be introduced to the following The origins of the relational model. The terminology of the relational model. How tables are used to
More informationTextbook: Chapter 6! CS425 Fall 2013 Boris Glavic! Chapter 3: Formal Relational Query. Relational Algebra! Select Operation Example! Select Operation!
Chapter 3: Formal Relational Query Languages CS425 Fall 2013 Boris Glavic Chapter 3: Formal Relational Query Languages Relational Algebra Tuple Relational Calculus Domain Relational Calculus Textbook:
More informationUNIT 2 RELATIONAL MODEL
UNIT 2 RELATIONAL MODEL RELATIONAL MODEL CONCEPTS The relational Model of Data is based on the concept of a Relation. A Relation is a mathematical concept based on the ideas of sets. The strength of the
More informationCMSC 424 Database design Lecture 18 Query optimization. Mihai Pop
CMSC 424 Database design Lecture 18 Query optimization Mihai Pop More midterm solutions Projects do not be late! Admin Introduction Alternative ways of evaluating a given query Equivalent expressions Different
More informationRelational Algebra. Relational Algebra. 7/4/2017 Md. Golam Moazzam, Dept. of CSE, JU
Relational Algebra 1 Structure of Relational Databases A relational database consists of a collection of tables, each of which is assigned a unique name. A row in a table represents a relationship among
More informationLecture 3 SQL. Shuigeng Zhou. September 23, 2008 School of Computer Science Fudan University
Lecture 3 SQL Shuigeng Zhou September 23, 2008 School of Computer Science Fudan University Outline Basic Structure Set Operations Aggregate Functions Null Values Nested Subqueries Derived Relations Views
More informationContents Contents Introduction Basic Steps in Query Processing Introduction Transformation of Relational Expressions...
Contents Contents...283 Introduction...283 Basic Steps in Query Processing...284 Introduction...285 Transformation of Relational Expressions...287 Equivalence Rules...289 Transformation Example: Pushing
More informationChapter 14: Query Optimization
Chapter 14: Query Optimization Database System Concepts 5 th Ed. See www.db-book.com for conditions on re-use Chapter 14: Query Optimization Introduction Transformation of Relational Expressions Catalog
More informationINF1383 -Bancos de Dados
INF1383 -Bancos de Dados Prof. Sérgio Lifschitz DI PUC-Rio Eng. Computação, Sistemas de Informação e Ciência da Computação A LINGUAGEM SQL Última Parte Group By/Having e Visões Alguns slides são baseados
More informationThe SQL database language Parts of the SQL language
DATABASE DESIGN I - 1DL300 Fall 2011 Introduction to SQL Elmasri/Navathe ch 4,5 Padron-McCarthy/Risch ch 7,8,9 An introductory course on database systems http://www.it.uu.se/edu/course/homepage/dbastekn/ht11
More informationCopyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Chapter 6 Outline. Unary Relational Operations: SELECT and
Chapter 6 The Relational Algebra and Relational Calculus Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 6 Outline Unary Relational Operations: SELECT and PROJECT Relational
More informationSQL. Lecture 4 SQL. Basic Structure. The select Clause. The select Clause (Cont.) The select Clause (Cont.) Basic Structure.
SL Lecture 4 SL Chapter 4 (Sections 4.1, 4.2, 4.3, 4.4, 4.5, 4., 4.8, 4.9, 4.11) Basic Structure Set Operations Aggregate Functions Null Values Nested Subqueries Derived Relations Modification of the Database
More informationv Conceptual Design: ER model v Logical Design: ER to relational model v Querying and manipulating data
Outline Conceptual Design: ER model Relational Algebra Calculus Yanlei Diao UMass Amherst Logical Design: ER to relational model Querying and manipulating data Practical language: SQL Declarative: say
More informationCS352 - DATABASE SYSTEMS. To give you experience with developing a database to model a real domain
CS352 - DATABASE SYSTEMS Database Design Project - Various parts due as shown in the syllabus Purposes: To give you experience with developing a database to model a real domain Requirements At your option,
More informationCSCC43H: Introduction to Databases. Lecture 3
CSCC43H: Introduction to Databases Lecture 3 Wael Aboulsaadat Acknowledgment: these slides are partially based on Prof. Garcia-Molina & Prof. Ullman slides accompanying the course s textbook. CSCC43: Introduction
More informationBasic Structure Set Operations Aggregate Functions Null Values Nested Subqueries Derived Relations Views Modification of the Database Data Definition
Chapter 4: SQL Basic Structure Set Operations Aggregate Functions Null Values Nested Subqueries Derived Relations Views Modification of the Database Data Definition Language 4.1 Schema Used in Examples
More informationCS352 - DATABASE SYSTEMS
CS352 - DATABASE SYSTEMS Database Design Project - Various parts due as shown in the syllabus Purposes: To give you experience with developing a database to model a real domain At your option, this project
More informationUNIT- II (Relational Data Model & Introduction to SQL)
Database Management System 1 (NCS-502) UNIT- II (Relational Data Model & Introduction to SQL) 2.1 INTRODUCTION: 2.1.1 Database Concept: 2.1.2 Database Schema 2.2 INTEGRITY CONSTRAINTS: 2.2.1 Domain Integrity:
More informationDatabase System Concepts
s Slides (fortemente) baseados nos slides oficiais do livro c Silberschatz, Korth and Sudarshan. Chapter 2: Model Departamento de Engenharia Informática Instituto Superior Técnico 1 st Semester 2009/2010
More informationOutline. Note 1. CSIE30600 Database Systems More SQL 2
Outline More Complex SQL Retrieval Queries Specifying Constraints as Assertions and Actions as Triggers Views (Virtual Tables) in SQL Schema Change Statements in SQL CSIE30600 Database Systems More SQL
More informationCS122 Lecture 5 Winter Term,
CS122 Lecture 5 Winter Term, 2017-2018 2 Last Time: SQL Join Expressions Last time, began discussing SQL join syntax Original SQL form: SELECT FROM t1, t2, WHERE P Any join conditions are specified in
More informationChapter 14 Query Optimization
Chapter 14 Query Optimization Chapter 14: Query Optimization! Introduction! Catalog Information for Cost Estimation! Estimation of Statistics! Transformation of Relational Expressions! Dynamic Programming
More informationChapter 14 Query Optimization
Chapter 14 Query Optimization Chapter 14: Query Optimization! Introduction! Catalog Information for Cost Estimation! Estimation of Statistics! Transformation of Relational Expressions! Dynamic Programming
More informationChapter 14 Query Optimization
Chapter 14: Query Optimization Chapter 14 Query Optimization! Introduction! Catalog Information for Cost Estimation! Estimation of Statistics! Transformation of Relational Expressions! Dynamic Programming
More informationDatabase Systems SQL SL03
Checking... Informatik für Ökonomen II Fall 2010 Data Definition Language Database Systems SQL SL03 Table Expressions, Query Specifications, Query Expressions Subqueries, Duplicates, Null Values Modification
More informationSQL QUERIES. CS121: Relational Databases Fall 2017 Lecture 5
SQL QUERIES CS121: Relational Databases Fall 2017 Lecture 5 SQL Queries 2 SQL queries use the SELECT statement General form is: SELECT A 1, A 2,... FROM r 1, r 2,... WHERE P; r i are the relations (tables)
More informationCPS 510 Data Base I. Query: find all SNRs whose scodes are greater than some SNRs whose name is CB.
11. ANY Query: find all SNRs whose scodes are greater than some SNRs whose name is CB. SQL: SELECT snr FROM s x WHERE scodes > ANY ( SELECT scode FROM s y WHERE y.sname= CB ); snr S2 S4 S5 12. ALL Query:
More informationLecture 1: Conjunctive Queries
CS 784: Foundations of Data Management Spring 2017 Instructor: Paris Koutris Lecture 1: Conjunctive Queries A database schema R is a set of relations: we will typically use the symbols R, S, T,... to denote
More informationCS 186, Fall 2002, Lecture 8 R&G, Chapter 4. Ronald Graham Elements of Ramsey Theory
Relational Calculus CS 186, Fall 2002, Lecture 8 R&G, Chapter 4 We will occasionally use this arrow notation unless there is danger of no confusion. Ronald Graham Elements of Ramsey heory Relational Calculus
More informationDatabase Systems SQL SL03
Inf4Oec10, SL03 1/52 M. Böhlen, ifi@uzh Informatik für Ökonomen II Fall 2010 Database Systems SQL SL03 Data Definition Language Table Expressions, Query Specifications, Query Expressions Subqueries, Duplicates,
More informationChapter 2: Intro to Relational Model
Chapter 2: Intro to Relational Model Database System Concepts, 6 th Ed. See www.db-book.com for conditions on re-use Example of a Relation attributes (or columns) tuples (or rows) 2.2 Attribute Types The
More informationChapter 4: SQL. Basic Structure
Chapter 4: SQL Basic Structure Set Operations Aggregate Functions Null Values Nested Subqueries Derived Relations Views Modification of the Database Joined Relations Data Definition Language Embedded SQL
More informationOther Relational Languages
Other Relational Languages 1 Tuple Relational Calculus A nonprocedural query language, where each query is of the form {t P (t ) } It is the set of all tuples t such that predicate P is true for t t is
More informationRelational model continued. Understanding how to use the relational model. Summary of board example: with Copies as weak entity
COS 597A: Principles of Database and Information Systems Relational model continued Understanding how to use the relational model 1 with as weak entity folded into folded into branches: (br_, librarian,
More informationCh 5 : Query Processing & Optimization
Ch 5 : Query Processing & Optimization Basic Steps in Query Processing 1. Parsing and translation 2. Optimization 3. Evaluation Basic Steps in Query Processing (Cont.) Parsing and translation translate
More informationQQ Group
QQ Group: 617230453 1 Extended Relational-Algebra-Operations Generalized Projection Aggregate Functions Outer Join 2 Generalized Projection Extends the projection operation by allowing arithmetic functions
More informationDATABASE DESIGN II - 1DL400
DATABASE DESIGN II - 1DL400 Fall 2016 A second course in database systems http://www.it.uu.se/research/group/udbl/kurser/dbii_ht16 Kjell Orsborn Uppsala Database Laboratory Department of Information Technology,
More informationDatabase System Concepts
Chapter 14: Optimization Departamento de Engenharia Informática Instituto Superior Técnico 1 st Semester 2007/2008 Slides (fortemente) baseados nos slides oficiais do livro c Silberschatz, Korth and Sudarshan.
More informationData Integration: Logic Query Languages
Data Integration: Logic Query Languages Jan Chomicki University at Buffalo Datalog Datalog A logic language Datalog programs consist of logical facts and rules Datalog is a subset of Prolog (no data structures)
More informationComp 5311 Database Management Systems. 2. Relational Model and Algebra
Comp 5311 Database Management Systems 2. Relational Model and Algebra 1 Basic Concepts of the Relational Model Entities and relationships of the E-R model are stored in tables also called relations (not
More informationRelational Calculus. Lecture 4B Kathleen Durant Northeastern University
Relational Calculus Lecture 4B Kathleen Durant Northeastern University 1 Relational Calculus Relational Calculus is an alternative way for expressing queries Main feature: specify what you want, not how
More information1. Considering functional dependency, one in which removal from some attributes must affect dependency is called
Q.1 Short Questions Marks 1. Considering functional dependency, one in which removal from some attributes must affect dependency is called 01 A. full functional dependency B. partial dependency C. prime
More information1. The rst database systems were based on the network and hierarchical models. These are covered briey
CMPT-354-98.2 Lecture Notes May 21, 1998 Chapter 3 The Relational Model 1. The rst database systems were based on the network and hierarchical models. These are covered briey in appendices in the text.
More informationCS121 MIDTERM REVIEW. CS121: Relational Databases Fall 2017 Lecture 13
CS121 MIDTERM REVIEW CS121: Relational Databases Fall 2017 Lecture 13 2 Before We Start Midterm Overview 3 6 hours, multiple sittings Open book, open notes, open lecture slides No collaboration Possible
More informationDatabase Systems. Answers
Database Systems Question @ Answers Question 1 What are the most important directories in the MySQL installation? Bin Executable Data Database data Docs Database documentation Question 2 What is the primary
More information3. Relational Data Model 3.5 The Tuple Relational Calculus
3. Relational Data Model 3.5 The Tuple Relational Calculus forall quantification Syntax: t R(P(t)) semantics: for all tuples t in relation R, P(t) has to be fulfilled example query: Determine all students
More informationChapter 12: Query Processing
Chapter 12: Query Processing Overview Catalog Information for Cost Estimation $ Measures of Query Cost Selection Operation Sorting Join Operation Other Operations Evaluation of Expressions Transformation
More information1. (a) Explain the Transaction management in a database. (b) Discuss the Query Processor of Database system structure. [8+8]
Code No: R059210506 Set No. 1 1. (a) Explain the Transaction management in a database. (b) Discuss the Query Processor of Database system structure. [8+8] 2. (a) What is an unsafe query? Give an example
More informationInformationslogistik Unit 4: The Relational Algebra
Informationslogistik Unit 4: The Relational Algebra 26. III. 2012 Outline 1 SQL 2 Summary What happened so far? 3 The Relational Algebra Summary 4 The Relational Calculus Outline 1 SQL 2 Summary What happened
More informationOperations of Relational Algebra
ITCS 3160 DATA BASE DESIGN AND IMPLEMENTATION JING YANG 2010 FALL Class 11: The Relational Algebra and Relational Calculus (2) 2 Operations of Relational Algebra 1 3 Operations of Relational Algebra (cont
More informationQuery Optimization. Shuigeng Zhou. December 9, 2009 School of Computer Science Fudan University
Query Optimization Shuigeng Zhou December 9, 2009 School of Computer Science Fudan University Outline Introduction Catalog Information for Cost Estimation Estimation of Statistics Transformation of Relational
More informationDATABASE TECHNOLOGY - 1MB025
1 DATABASE TECHNOLOGY - 1MB025 Fall 2004 An introductory course on database systems http://user.it.uu.se/~udbl/dbt-ht2004/ alt. http://www.it.uu.se/edu/course/homepage/dbastekn/ht04/ Kjell Orsborn Uppsala
More informationDatabase System Concepts, 5th Ed.! Silberschatz, Korth and Sudarshan See for conditions on re-use "
Database System Concepts, 5th Ed.! Silberschatz, Korth and Sudarshan See www.db-book.com for conditions on re-use " SQL Data Types and Schemas! Integrity Constraints! Authorization! Embedded SQL! Dynamic
More informationCSCC43H: Introduction to Databases. Lecture 4
CSCC43H: Introduction to Databases Lecture 4 Wael Aboulsaadat Acknowledgment: these slides are partially based on Prof. Garcia-Molina & Prof. Ullman slides accompanying the course s textbook. CSCC43: Introduction
More informationDATABASTEKNIK - 1DL116
1 DATABASTEKNIK - 1DL116 Spring 2004 An introductury course on database systems http://user.it.uu.se/~udbl/dbt-vt2004/ Kjell Orsborn Uppsala Database Laboratory Department of Information Technology, Uppsala
More informationRelational Algebra and Calculus. Relational Query Languages. Formal Relational Query Languages. Yanlei Diao UMass Amherst Feb 1, 2007
Relational Algebra and Calculus Yanlei Diao UMass Amherst Feb 1 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke 1 Relational Query Languages A major strength of the relational model: supports simple
More informationChapter 2: Intro to Relational Model
Non è possibile visualizzare l'immagine. Chapter 2: Intro to Relational Model Database System Concepts, 6 th Ed. See www.db-book.com for conditions on re-use Example of a Relation attributes (or columns)
More informationRelational Model. Prepared by: Ms. Pankti Dharwa ( Asst. Prof, SVBIT)
2. Relational Model Prepared by: Ms. Pankti Dharwa ( Asst. Prof, SVBIT) Attribute Types Each attribute of a relation has a name The set of allowed values for each attribute is called the domain of the
More informationRelational Calculus. Chapter Comp 521 Files and Databases Fall
Relational Calculus Chapter 4.3-4.5 Comp 521 Files and Databases Fall 2010 1 Relational Calculus Comes in two flavors: Tuple relational calculus (TRC) and Domain relational calculus (DRC). Calculus has
More informationViews, assertions, and triggers
Views, assertions, and triggers Views are a mechanism for customizing the database; also used for creating temporary virtual tables Assertions provide a means to specify additional constraints Triggers
More informationRELATIONAL ALGEBRA. CS121: Relational Databases Fall 2017 Lecture 2
RELATIONAL ALGEBRA CS121: Relational Databases Fall 2017 Lecture 2 Administrivia 2 First assignment will be available today Due next Thursday, October 5, 2:00 AM TAs will be decided soon Should start having
More information2.2.2.Relational Database concept
Foreign key:- is a field (or collection of fields) in one table that uniquely identifies a row of another table. In simpler words, the foreign key is defined in a second table, but it refers to the primary
More informationChapter 8: Relational Algebra
Chapter 8: elational Algebra Outline: Introduction Unary elational Operations. Select Operator (σ) Project Operator (π) ename Operator (ρ) Assignment Operator ( ) Binary elational Operations. Set Operators
More informationDATABASE TECHNOLOGY - 1MB025
1 DATABASE TECHNOLOGY - 1MB025 Fall 2005 An introductury course on database systems http://user.it.uu.se/~udbl/dbt-ht2005/ alt. http://www.it.uu.se/edu/course/homepage/dbastekn/ht05/ Kjell Orsborn Uppsala
More informationADVANCED SQL DDL. CS121: Relational Databases Fall 2017 Lecture 10
ADVANCED SQL DDL CS121: Relational Databases Fall 2017 Lecture 10 Advanced SQL DDL 2 Last time, covered stored procedures and user-defined functions (UDFs) Relatively simple but powerful mechanism for
More informationRelational Databases
Relational Databases Jan Chomicki University at Buffalo Jan Chomicki () Relational databases 1 / 49 Plan of the course 1 Relational databases 2 Relational database design 3 Conceptual database design 4
More informationSQL DATA DEFINITION: KEY CONSTRAINTS. CS121: Relational Databases Fall 2017 Lecture 7
SQL DATA DEFINITION: KEY CONSTRAINTS CS121: Relational Databases Fall 2017 Lecture 7 Data Definition 2 Covered most of SQL data manipulation operations Continue exploration of SQL data definition features
More informationDatabase Management System 11
Database Management System 11 School of Computer Engineering, KIIT University 11.1 Language in which user requests information from the database are: Procedural language Nonprocedural language The categories
More informationComp 5311 Database Management Systems. 4b. Structured Query Language 3
Comp 5311 Database Management Systems 4b. Structured Query Language 3 1 SQL as Data Definition Language Creates the Students relation. The type (domain) of each field is specified, and enforced by the
More informationChapter 2: Relational Model
Chapter 2: Relational Model Database System Concepts, 5 th Ed. See www.db-book.com for conditions on re-use Chapter 2: Relational Model Structure of Relational Databases Fundamental Relational-Algebra-Operations
More informationDatabase Systems CSE Comprehensive Exam Spring 2005
Database Systems CSE 5260 Spring 2005 Database Schema #1 Branch (Branch_Name, Branch_City, Assets) Customer (Customer_Name, SS#, Street, City, State, Zip_Code) Account (Account_Number, Branch_Name, Balance)
More informationDBMS: AN INTERACTIVE TUTORIAL
DBMS: AN INTERACTIVE TUTORIAL Organized & Prepared By Sharafat Ibn Mollah Mosharraf 12 th Batch (05-06) Dept. of Computer Science & Engineering University of Dhaka Table of Contents INTRODUCTION TO DATABASE
More informationDATABASE TECHNOLOGY - 1MB025 (also 1DL029, 1DL300+1DL400)
1 DATABASE TECHNOLOGY - 1MB025 (also 1DL029, 1DL300+1DL400) Spring 2008 An introductury course on database systems http://user.it.uu.se/~udbl/dbt-vt2008/ alt. http://www.it.uu.se/edu/course/homepage/dbastekn/vt08/
More informationLecture Notes for 3 rd August Lecture topic : Introduction to Relational Model. Rishi Barua Shubham Tripathi
Lecture Notes for 3 rd August 2011 Lecture topic : Introduction to Relational Model Rishi Barua 09010141 Shubham Tripathi 09010148 Example of a relation. Attribute (Column) ID Name Department Salary (Rs)
More informationRelational Model & Algebra. Announcements (Tue. Sep. 3) Relational data model. CompSci 316 Introduction to Database Systems
Relational Model & Algebra CompSci 316 Introduction to Database Systems Announcements (Tue. Sep. 3) Homework #1 has been posted Sign up for Gradiance now! Windows Azure passcode will be emailed soon sign
More informationFirst lecture of this chapter is in slides (PPT file)
First lecture of this chapter is in slides (PPT file) Review of referential integrity CREATE TABLE other_table ( b1 INTEGER, c1 INTEGER, PRIMARY KEY (b1, c1) ) CREATE TABLE t ( a integer PRIMARY KEY, b2
More informationRelational Calculus. Chapter Comp 521 Files and Databases Fall
Relational Calculus Chapter 4.3-4.5 Comp 521 Files and Databases Fall 2016 1 Relational Calculus Comes in two flavors: Tuple relational calculus (TRC) and Domain relational calculus (DRC). Calculus has
More informationCOURSE OVERVIEW THE RELATIONAL MODEL. CS121: Relational Databases Fall 2017 Lecture 1
COURSE OVERVIEW THE RELATIONAL MODEL CS121: Relational Databases Fall 2017 Lecture 1 Course Overview 2 Introduction to relational database systems Theory and use of relational databases Focus on: The Relational
More informationCOURSE OVERVIEW THE RELATIONAL MODEL. CS121: Introduction to Relational Database Systems Fall 2016 Lecture 1
COURSE OVERVIEW THE RELATIONAL MODEL CS121: Introduction to Relational Database Systems Fall 2016 Lecture 1 Course Overview 2 Introduction to relational database systems Theory and use of relational databases
More informationIntroduction Alternative ways of evaluating a given query using
Query Optimization Introduction Catalog Information for Cost Estimation Estimation of Statistics Transformation of Relational Expressions Dynamic Programming for Choosing Evaluation Plans Introduction
More informationDomain Constraints Referential Integrity Assertions Triggers. Authorization Authorization in SQL
Chapter 6: Integrity and Security Domain Constraints Referential Integrity Assertions Triggers Security Authorization Authorization in SQL 6.1 Domain Constraints Integrity constraints guard against accidental
More information