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

B+ tree, construct a B+ tree for the following set of key value (2,3,5,7,11...

construct a B+ tree for the following set of key value (2,3,5,7,11,19,23,29,31) in ascending order where the pointers that will fit in one node is as follows:A. four B. six C. eigh

Strong entity set and weak entity set, Strong entity set and weak entity se...

Strong entity set and weak entity set? Strong entity set and weak entity set: A strong entity set has a primary key. All tuples in the set are distinguishable through that key.

Which types of data supported by mysql, Which types of data supported by My...

Which types of data supported by MySQL for Time and Date formats?  MySQL supports a number of time and date column formats: Some of them are 1) DATE 2) DATETIME 3) TIM

Determine the three views of data, Determine the Three Views of Data We...

Determine the Three Views of Data We know that the similar thing, if viewed from dissimilar angles produces difference sights. Similarly, the database that we have formed alrea

Provide the steps involved in ethical analysis, Question : Mr. Smith Ha...

Question : Mr. Smith Harry has a car manufacturing company which has recently integrated management information system. He wishes to obtain more information on ethics and socia

State the rearranging the execution order for efficiency, Define the step -...

Define the step - Rearranging the Execution Order for Efficiency As we know that algorithm and data structure are closely related to one another, but data structure is conside

Compute the closure set, Compute the closure (F+) for the following set of ...

Compute the closure (F+) for the following set of the functional dependencies defined on R(a,b,c,d), where F - {c→ a, ab → d, a → b, d → c}, i.e. what are all of the FDs implied b

Determine bcnf-dcnf and key relation, (A) For the relation; CarSales (R...

(A) For the relation; CarSales (RegNo, BuyerName, Address, SalesPerson, Make, Model, Commission) The following functional dependences hold, RegNo _ID à Make, Model Reg

Objectives-distributed and client server databases, Objectives diff...

Objectives differentiate DDBMS and conventional DBMS; Describe Network topology for DDBMS; Describe the concepts of horizontal and vertical fragmentation; Descr

Define control files, Control Files : The redo and control files logs supp...

Control Files : The redo and control files logs support the rest of the architecture. Every database must have at least one control file, although you have more than one to guard

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