Calculate the number of tuples, PL-SQL Programming

Assignment Help:

Question:

(a) The objective of query optimization is to choose the most efficient strategy for implementing a given relational query, thereby improving the system performance. One of the stages of query optimization is to convert the internal form into equivalent and more efficient canonical form, using well-defined transformation rules. Two rules of the transformation rules is given below:

Rule 1 - Transform a sequence of restrictions against a given relation into a single (ANDed) restriction.

Rule 2 - Transform a restriction of a projection into a projection of a restriction.

(i) Explain what is meant by each of the above rules.

(ii) Using the relational schema given in Appendix, provide example of each of the above rules.

(b) Refer to the relational schema given in Appendix.

Assuming that:

 The Employee relation contains 1000 records among which 300 employee are assigned to departments located in the United States.
- The Department relation contains 30 records among which 20 departments are located in United States
- The Location relation contains 20 records among which 5 are situated in the United States.

(i) Express the following query in SQL:

"find the employee Last names and the department names who are working in United States (Location.country_id = US)

(ii) Choose two possible methods to evaluate the query, and use the relational algebra to formulate clearly all the steps required in the evaluation. For each method, calculate the number of tuples for all the intermediate relations (namely, size of the intermediate relations) required for each step.


Related Discussions:- Calculate the number of tuples

While-loop - iterative control, WHILE-LOOP The WHILE-LOOP statement rela...

WHILE-LOOP The WHILE-LOOP statement relates a condition with the series of statements enclosed by the keywords LOOP and END LOOP, as shown: WHILE condition LOOP sequence_of_sta

Example of coalesce operator - sql, Example of COALESCE operator Examp...

Example of COALESCE operator Example: Give the total of marks for each exam (simplified solution) SELECT CourseId, COALESCE ((SELECT SUM (Mark) FROM EXAM_MARK AS EM

Ssrs report writing, SSRS Report Writing Project Description: This re...

SSRS Report Writing Project Description: This report is part of a larger project to make a SQL Server Reporting Service (SSRS) based reporting solution. There can be more rep

%rowcount, %ROWCOUNT When its cursor or cursor variable is opened, the...

%ROWCOUNT When its cursor or cursor variable is opened, the %ROWCOUNT is zeroed. Before the first fetch, the %ROWCOUNT yields 0. Afterward, it yields the number of rows fetche

Defining records, Defining and Declaring Records To create records, yo...

Defining and Declaring Records To create records, you have to define a RECORD type, and then declare records of that type. You may also define RECORD types in the declarative

Primary key - sql, Primary Key - SQL A PRIMARY KEY specification carri...

Primary Key - SQL A PRIMARY KEY specification carries an implicit NOT NULL constraint on each column of the specified key. When more than one key constraint is required, the k

%found - explicit cursor attributes, %FOUND Subsequent to a cursor or ...

%FOUND Subsequent to a cursor or cursor variable is opened but before the first fetch, the %FOUND yields NULL. Afterward, it yields TRUE when the last fetch returned a row, or

Advantages of exceptions, Advantages of Exceptions Using the exception...

Advantages of Exceptions Using the exceptions for the error handling has many benefits. Without an exception handling, every time you issue a command, you should ensure for th

Conditionals - sql, Conditionals - SQL At first sight SQL does not app...

Conditionals - SQL At first sight SQL does not appear to have a single operator for expressing logical implication. In this respect it would be in common with most programming

Overview of control structures-comparison operators, Overview of control st...

Overview of control structures According to the structure theorem, any computer program can be written by using the basic control structures as shown in figure below. They can b

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