Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Define the Query optimisation
The query parser commonly generates a standard initial tree to correspond to an SQL query, with no doing any optimization. Such type of a canonical query tree denotes a relational algebra expression that is extremely inefficient if executed directly. A query commonly has many possible execution strategies, and the process of choosing a appropriate one for processing a query is termed as query optimization. The major guidelines that are applied throughout query optimization are:
a. Combine a cascade of selections
b. Combine a cascade of projections
c. Commute selection and projection
d. Commuting selection with join / cartesian product Commuting projection with join or cartesian product
e. Commute projection with set operations
f. Commute selection with set operations
What is a guard condition? Explain it with a suitable example. The guard-condition is a Boolean expression written with respect to parameters of triggering event and attributes
What are domain constraints? A domain is a set of values that might be assigned to an attribute .all values that appear in a column of a relation must be taken from the similar
Data Warehousing & Mining 1. What is the concept of knowledge discovery in database? 2. Describe the following types of Multidimensional Data Models. • Stars, Snowflakes and
Create 1 experiment to demonstrate an aspect of query optimisation by using access-path structures (indexes), decomposition, or denormalisation. Once satisfied with your experiment
A well-maintained relational DBMS has a high level of data integrity. What features of a relational DBMS contribute towards this level of integrity? Relational DBMS gives high
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
What is called an evaluation primitive? A relational algebra operation annotated with instructions on how to evaluate is known as an evaluation primitive.
What is a database graph? The partial ordering implies that the set D may now be viewed as a directed acyclic graph, known as a database graph.
What is banker's algorithm? Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple instances of each resource ty
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
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd