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
When are two schedules said to be view equivalent? Ans: Two schedules that is denoted as S and S' are said to be view equivalent if the subsequent three conditions are met
Discuss the problem of Spurious tuples and how we may prevent it. Ans: A spurious tuple is, mainly, a record in a database that gets created while two tables are joined bad
What is a heterogeneous distributed database? In a heterogeneous distributed database, dissimilar sites may use different schemas, and dissimilar dbms s/w. The sites may not be
It defines that no primary key value can be null. This is as the primary key is used to recognize individual tuple in the relation. So we will not be able to recognize the records
Explain four causes for failures in data warehouse projects
Explain Alternate key? Alternate Key - All the candidate keys except primary key are known as alternate keys.
Is it mandatory to declare all the tables in Report by the key word tables for all the tables that exist in the structure of LDB, and are being explained in the Database part of LD
Question: Consider the following database relations for a textbook ordering system used by a college bookshop: Book (b-copy#, bname, ISBN#, author, price, subject) Order (s#
Question : Mr. Smith Harry has a car manufacturing company which has recently integrated management information system. He wishes to obtain more information on ethics and socia
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
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