How does a query tree represent a relational algebra expression?     

Ans: This includes transforming an initial expression (tree) into an equivalent expression (tree) that is more proficient to execute. Two relational algebra expressions are said to be equal if the two expressions produce two relation of the same set of attributes and consist of the same set of tuples even though their attributes may be ordered in a different way.

 The query tree is a data structure which denotes the relational algebra expression in the query optimization process. In the query tree the leaf nodes correspond to the input relations of the query. The internal nodes denote the operators in the query. While executing the query, the system will execute an internal node operation when its operands available after that the internal node is replaced by the relation which is acquired from the preceding execution.

Posted Date: 5/6/2013 3:09:25 AM | Location : United States

Ask an Expert

Related Discussions:- Explain query tree represent relational algebra expression, Assignment Help, Ask Question on Explain query tree represent relational algebra expression, Get Answer, Expert's Help, Explain query tree represent relational algebra expression Discussions

Write discussion on Explain query tree represent relational algebra expression
Your posts are moderated

Write your message here..

Related Questions

How do you find the final model after iterative analysis, How do you find t... How do you find the final model after iterative analysis? Why is iterative analysis of any of the problem needed? The final model serves as the base for system architectur

Management information system, management information system based on funct... management information system based on functional organisation

Data envelopment analysis , I need a help with my assignment of data envelo... I need a help with my assignment of data envelopment analysis which is due for submission next week on monday the 10th Dec. Will you be able to help so that I can submit it on tim

What is structured query langauge, What is Structured Query Langauge (SQL)?... What is Structured Query Langauge (SQL)? SQL is a powerful set-oriented language which was formed by IBM research for the databases that adhere to the relational model. It havi

Components of database manager, Components of database manager The ab... Components of database manager The above functions are reached by the database manager. The major elements of a database manager are: Authorisation control: This mod

Money making supermarket chain problem, Consider the ER schema below for th... Consider the ER schema below for the MoneyMaking supermarket chain problem. Translate the given ER schema into SQL CREATE TABLE statement.

What is data mining?, Question 1 Define OLTP? Explain the Differences betw... Question 1 Define OLTP? Explain the Differences between OLTP and Data Warehouse Question 2 What is Architecture? Explain various components involved in it Question

What is serializability, What is serializability? Explain its types? Th... What is serializability? Explain its types? The data base system must control concurrent implementation of transactions, to ensure that the data base state remains consistent.

Correlated and uncorrelated queries, need to get answer for questions 3&4 o... need to get answer for questions 3&4 on this page in part 1

Compare three clustering algorithms in weka, Compare three clustering algor... Compare three clustering algorithms in Weka. For this comparison, you will need to use at least two different datasets. Run the algorithms on the datasets, and use the visual