Explain projection operation distribute over union operation, Database Management System

Assignment Help:

Illustrate the statement 'Projection operation distributes over the union operation'. Give an example.   

Ans: ΠL(E1 ∪ E2) = (ΠL(E1)) ∪ (ΠL(E2))  

This says that result acquired by projecting on an attribute set A, after taking union of two relations is similar as union of two relations each of which is a projection of original relations on A.


Related Discussions:- Explain projection operation distribute over union operation

What is sql, What is SQL, and why is it important? SQL stands for Struc...

What is SQL, and why is it important? SQL stands for Structured Query Language, and is the most significant data processing language in use today. It is not a complete programm

Fragmentation-design of distributed databases, Fragmentation: It is defini...

Fragmentation: It is definite as partitioning of a relation into various fragments.Every fragment can be stored at a dissimilar site.

Types of locks, Types of Locks There are two necessary types of locks: ...

Types of Locks There are two necessary types of locks: Binary lock : This locking mechanism has two states for to a data item: locked or unlocked Multiple-mode loc

Tuples-attributes , Consider a relation s over the attributes A and B wit...

Consider a relation s over the attributes A and B with the following characteristics: 5,000 tuples with 10 tuples per page A 2-level B+ tree index on attribute

What are the problems in database normalization, What are the problems if o...

What are the problems if one were not to normalize?  When do these problems surface?           Ans:  Database normalization, sometimes considered to as  canonical synthesis, is

What is the candidate key for a table with columns, For problems 1-4, give ...

For problems 1-4, give all candidate keys for the tables with FDs specified.  Composite candidate keys must be put in parentheses, and candidate keys must be separated with commas

Example of sequences, Example : Create a sequence named SEQSS that starts a...

Example : Create a sequence named SEQSS that starts at 105, has a step of 1 and can take maximum value as 2000.  CREATE SEQUENCE SEQSS START WITH 105 INCREMENT BY 1 MAX VA

What are the types of indices, Normal 0 false false false ...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Define the terms - physical schema and logical schema, Define the terms  1)...

Define the terms  1) physical schema 2) logical schema.  Physical schema:  The physical schema explains the database design at the physical level, which  is  the  lowest  lev

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