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
basic structure of xml

In case of entity integrity, the primary key may be declared? In a case of entity integrity primary key may be not Null.

Lack of Redundancy We have talked about the problems of repetition of information in a database. Such repetition should be stay away as much as possible. Let us state once again t

What are the requirements to ensure the objectives of file management principle is realized?

It is mandatory that for every table in the LDB hierarchy there should exist one GET statement in the report. False.  It is not essential.

Process to find the non-concurrent objects Once we find out non-concurrent (mutually exclusive) objects, we can fold all objects together in one thread of process or control. O

Define the concept of aggregation.  Give two examples where this concept is useful. Ans: Aggregation transforms a relationship among the objects into a higher-level object. A

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

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

Secondary Indexes Let consider the student database and its clustering index and primary (only one will be applicable at a time). Now consider the state when the database is to