Explain query tree represent relational algebra expression, Database Management System

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

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
Related Questions
sql is relationally complete-justify

WHERE and HAVING clause in SQL ? The WHERE clause is commonly used for implementing conditions on each tuple of the relation. The HAVING clause is used in combination along wi

properties of derirable decomposition

#question. acompani datdbase needs to store information about employees (identified by a social security number,with salary and phone as attributes) and departments (identified by

Explain the term- Query. Queries are used to repossess and show specific records in a table. They can also be used to show specific fields of specific records, which meet the co

Define Aggregate functions and what aggregate functions supported by the MySQL To calculate a summary value from a set of individual values and uses one of the functions known

Explain mechanism of nested queries? SQL gives a mechanism for nesting subqueries. A subquery is a select from where expression that is nested within one more query. A common u

Consider the following relational scheme: R (a,b,c,d,e,f) and its corresponding set of FDs {d→ a, be → c, ac → e, b → f, f → d, a → c}. a. Is the following decomposition i) non

Convert the following ER - diagram (Entity Relationship Diagram) into a relational database (the primary keys are underlined):       Ans:  The relational database schema f

My cut off date is very soon in a Database subject and i dont know how to solve anything in it