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!
How does a query tree represent a relational algebra expression? Discuss any three rules for query optimisation, giving example as to when should each rule be applied.
Ans: A query tree is a tree structure which refers to a relational algebra expression. It denotes the input relations as leaf nodes of the tree, and denotes the relational algebra operations as internal nodes. An execution of the query tree contains executing an internal node operation while its operands are available and after that replacing that internal node by the relation which results from executing the operation. The execution terminates while the root node is executed and generates the result relation for the query. For instance, the query tree for the relational algebra expression
∏E_No =(σp_No = 'DB2003' (Assigned_To) :
The three rules for query optimization are like this:
∏1(∏2(......∏n ( R))) ≡ ∏1(R )
∏A1, A2,......An (σC (R ) ≡ σC (∏A1, A2, ......An (R ))..... ))
σC1 AND C2 AND ....AND Cn (R ) ≡ σC1 (σC2(....(σCn (R ))....))
Consider the ER schema below for the MoneyMaking supermarket chain problem. Translate the given ER schema into SQL CREATE TABLE statement.
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
Define identify relationship? Identifying relationship: An identifying relationship means in which the child table cannot be uniquely recognize without the parent. For exampl
DML Precompiler All the DBMS have two basic sets of Languages - Data Definition Language (DDL) that have the set of commands needed to define the format of the data that is b
Problem: (a) Data mining is one of the best ways to analyse data and using software techniques, hidden and unexpected patterns and relationships in sets of data can be extrac
Explain the Aggregation implies concurrency Concurrency actually is: This in objects can be identified by the way they change state. Present objects can change state independen
What is NULL? Simply NULL means not in value.
What is ICR? A. ICR (Intelligent Character Recognition) is a technology that gives scanning and imaging systems the ability to identify images of hand-printed or script charact
project on dbms
Accessing information about permissions to all users- Object level permissions: With the use of data dictionary you can see the permissions to user. Let us get the table name fro
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