Define views in relational algebra, Database Management System

Assignment Help:

Views in relational algebra: 

 1. Basic expression contains either 

a) A relation in the database.

b) A constant relation.

2.  General expressions are madde out of smaller sub expressions using 

a) σp(E1) select (p a predicate) 

b) ∏s(E1) project (s a list of attributes) 

c) Px(E1)rename (x a relation name) 

d) E1∪E2 union

e) E1- E2 set difference 

f) E1x x E2 cartesian product


Related Discussions:- Define views in relational algebra

Explain relevance of data dictionary in a database system, Explain the rele...

Explain the relevance of Data Dictionary in a Database System? Data dictionary is a database in its own right residing on the disk that consist of Meta data which is = Data abo

Sql insert statements, Submit SQL INSERT Statements that will populate the ...

Submit SQL INSERT Statements that will populate the database with sample data.  You must insert at least 5 records into each table in your database.Submit your SQL INSERT Statement

What is ocr, What is OCR? OCR (Optical Character Recognition) is a tech...

What is OCR? OCR (Optical Character Recognition) is a technology that enables you to change different types of machine-readable documents, like scanned paper documents, PDF fil

Objectives-transactions and concurrency management, Objectives After Re...

Objectives After Reading this part, you should be able to: Explain the term CONCURRENCY; Describe the term transaction and concurrent transactions; Talk about co

Explain algorithm of er to relational mapping, Explain algorithm of ER To R...

Explain algorithm of ER To Relational Mapping ? ER-to-Relational Mapping Algorithm: 1) Step 1: Mapping of regular entity types: For each strong entity type E, form a relatio

Index and tree structure, Index And Tree Structure Let us talk about th...

Index And Tree Structure Let us talk about the data structure that is used for creating indexes. Can we use Binary Search Tree (BST) as Indexes? Let us initial reconsider

Explain the weak entity set, Explain the Weak Entity Set An Entity set...

Explain the Weak Entity Set An Entity set which does not have sufficient attribute to make a primay key is known as weak entity set. For instance, dependents of an employee in

Delete - referential integrity, During the deletion of a tuple two cases ca...

During the deletion of a tuple two cases can happen: Deletion of tuple in relation having the foreign key: In this type of case simply delete the desired tuple. For example, in

xml, basic structure of xm

basic structure of xml

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd