Презентация Relational algebra. Lecture 8 онлайн

На нашем сайте вы можете скачать и просмотреть онлайн доклад-презентацию на тему Relational algebra. Lecture 8 абсолютно бесплатно. Урок-презентация на эту тему содержит всего 26 слайдов. Все материалы созданы в программе PowerPoint и имеют формат ppt или же pptx. Материалы и темы для презентаций взяты из открытых источников и загружены их авторами, за качество и достоверность информации в них администрация сайта не отвечает, все права принадлежат их создателям. Если вы нашли то, что искали, отблагодарите авторов - поделитесь ссылкой в социальных сетях, а наш сайт добавьте в закладки.
Презентации » Математика » Relational algebra. Lecture 8


Оцените!
Оцените презентацию от 1 до 5 баллов!
Смотреть онлайн
Скачать
  • Тип файла:
    ppt / pptx (powerpoint)
  • Всего слайдов:
    26 слайдов
  • Для класса:
    1,2,3,4,5,6,7,8,9,10,11
  • Размер файла:
    371.20 kB
  • Просмотров:
    98
  • Скачиваний:
    0
  • Автор:
    неизвестен


Слайды и текст к этой презентации:

№1 слайд
Database Management Systems
Содержание слайда: Database Management Systems LECTURE 8 Relational algebra IITU, ALMATY, 2019
№2 слайд
SQL Structure DDL Data
Содержание слайда: SQL Structure DDL (Data Definition Language) DML (Data Manipulation Language) TCL (Transaction Control Language) DCL (Data Control Language)
№3 слайд
Review of last lecture SQL A
Содержание слайда: Review of last lecture: SQL A DML is a language which enables to access and manipulate data. DML commands: INSERT UPDATE DELETE
№4 слайд
Querying Data From Tables
Содержание слайда: Querying Data From Tables Query operations facilitate data retrieval from one or more tables. The result of any query is a table. The result can be further manipulated by other query operations.
№5 слайд
Querying Data From Tables SQL
Содержание слайда: Querying Data From Tables SQL allows to query data using SELECT statement. Syntax: SELECT attribute(s) FROM table(s) WHERE selection condition(s);
№6 слайд
Relational algebra Relational
Содержание слайда: Relational algebra Relational algebra, first described by E.F. Codd, is a family of algebras with a well-founded semantics used for modelling the data stored in relational databases, and defining queries on it. Once the data is normalized in sets of data (entities), the main operations of the relational algebra can be performed. The main application of relational algebra is providing a theoretical foundation for relational databases.
№7 слайд
Relational algebra Similar to
Содержание слайда: Relational algebra Similar to normal algebra, except we use relations as values instead of numbers, and the operations and operators are different. Not used as a query language in actual DBMSs (SQL instead). We need to know about relational algebra to understand query execution in a relational DBMS.
№8 слайд
Querying Data From Tables The
Содержание слайда: Querying Data From Tables The operations for querying data: projection selection union difference intersection join
№9 слайд
Projection Projection,
Содержание слайда: Projection Projection, referred to as Π (pi) Selects a set of attributes from a table The attributes are subscripts to Π and the table is in parenthesis Π stud_id (Students) Projection is represented in a SQL SELECT statement’s attribute list. The above projection is synonymous to the following SQL query: SELECT stud_id FROM Students;
№10 слайд
Selection Selection, referred
Содержание слайда: Selection Selection, referred to as σ (sigma) Selects a set of rows from a table that satisfy a selection condition The selection condition is the subscript to σ and the table is in parenthesis. σ stud_id=01 (Students)
№11 слайд
Selection In SQL, selection
Содержание слайда: Selection In SQL, selection is represented in the WHERE clause of a select statement. Translate σ stud_id=01 (Students) to SQL: SELECT * FROM Students WHERE stud_id=01; What does SELECT * mean? It means that we are selecting all data – all attributes - from a table.
№12 слайд
Union R U R is the relation
Содержание слайда: Union (R1 U R2) is the relation containing all tuples that appear in R1, R2, or both. Union (R1 U R2) is the relation containing all tuples that appear in R1, R2, or both. Set difference (R1 - R2) is the relation containing all tuples of R1 that do not appear in R2. Intersection (R1 ∩ R2) is the relation containing all tuples that appear only in both R1 and R2.
№13 слайд
Union-compatible Two tables
Содержание слайда: Union-compatible Two tables must be union-compatible for the operations to work: Tables need to have same number of attributes The domain of each attribute must also be the same.
№14 слайд
Union-compatible example
Содержание слайда: Union-compatible: example
№15 слайд
Support in SQL For Union SQL
Содержание слайда: Support in SQL For Union SQL supports the UNION operator. For Difference (or Set Difference) SQL supports the EXCEPT operator. For Intersection SQL supports the INTERSECT operator.
№16 слайд
Combining Queries The results
Содержание слайда: Combining Queries The results of two queries can be combined using the set operations union, intersection, and difference. The syntax is query1 UNION [ALL] query2 query1 INTERSECT [ALL] query2 query1 EXCEPT [ALL] query2 query1 and query2 are queries that can use any of the features discussed up to this point.
№17 слайд
Combining Queries Set
Содержание слайда: Combining Queries Set operations can also be nested and chained, for example query1 UNION query2 UNION query3 which is executed as: (query1 UNION query2) UNION query3 In order to calculate the union, intersection, or difference of two queries, the two queries must be "union compatible", which means that they return the same number of columns and the corresponding columns have compatible data types.
№18 слайд
Union UNION The UNION
Содержание слайда: Union / UNION The UNION operation on relation A UNION relation B designated as A∪B, includes all tuples that are in A or in B, eliminating duplicate tuples. To include duplicates, use the UNION ALL operator. SQL Syntax: SELECT * From A UNION SELECT * From B
№19 слайд
UNION SELECT From R UNION
Содержание слайда: UNION SELECT * From R UNION SELECT * From S
№20 слайд
UNION ALL SELECT From R UNION
Содержание слайда: UNION ALL SELECT * From R UNION ALL SELECT * From S
№21 слайд
Set Difference EXCEPT The
Содержание слайда: Set Difference / EXCEPT The DIFFERENCE operation includes tuples from one relation that are not in another relation. Let the Relations be A and B, the operation A EXCEPT B is denoted by A – B, that results in tuples that are A and not in B. SQL Syntax: SELECT * FROM A EXCEPT SELECT * FROM B
№22 слайд
EXCEPT SELECT FROM R EXCEPT
Содержание слайда: EXCEPT SELECT * FROM R EXCEPT SELECT * FROM S
№23 слайд
EXCEPT SELECT FROM S EXCEPT
Содержание слайда: EXCEPT SELECT * FROM S EXCEPT SELECT * FROM R
№24 слайд
Intersection INTERSECT The
Содержание слайда: Intersection / INTERSECT The INTERSECTION operation on a relation A INTERSECT relation B, designated by A ∩ B, includes tuples that are only in A and B. In other words only tuples belonging to A and B, or shared by both A and B are included in the result. SQL Syntax: SELECT * FROM A INTERSECT SELECT * FROM B
№25 слайд
INTERSECT SELECT FROM R
Содержание слайда: INTERSECT SELECT * FROM R INTERSECT SELECT * FROM S
№26 слайд
Books Connolly, Thomas M.
Содержание слайда: Books Connolly, Thomas M. Database Systems: A Practical Approach to Design, Implementation, and Management / Thomas M. Connolly, Carolyn E. Begg.- United States of America: Pearson Education Garcia-Molina, H. Database system: The Complete Book / Hector Garcia-Molina.- United States of America: Pearson Prentice Hall Sharma, N. Database Fundamentals: A book for the community by the community / Neeraj Sharma, Liviu Perniu.- Canada www.postgresql.org/docs/manuals/
Скачать все slide презентации Relational algebra. Lecture 8 одним архивом:
Скачать
Похожие презентации