The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 103 Weeks Ago, 2 Days Ago |
| Questions Answered: | 4870 |
| Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
What is metadata? What metadata is stored in the system catalog? Describe the information stored per relation, and per index. (Section 12.1)
The catalog is itself stored as a collection of relations. Explain why. (Section 12.1)
What three techniques are commonly used in algorithms to evaluate relational operators? (Section 12.2)
What is an access path? When does an index match a search condition? (Section 12.2.2)
What are the main approaches to evaluating selections? Discuss the use of indexes, in particular. (Section 12.3.1)
What are the main approaches to evaluating projections? What makes projections potentially expensive? (Section 12.3.2)
What are the main approaches to evaluating joins? Why are joins expensive? (Section 12.3.3)
What is the goal of query optimization? Is it to find the best plan? (Section 12.4)
How does a DBMS represent a relational query evaluation plan? (Section 12.4.1)
What is pipelined evaluation? What is its benefit? (Section 12.4.2)
1. Describe three techniques commonly used when developing algorithms for relational operators. Explain how these techniques can be used to design algorithms for the selection, projection, and join operators.
2. What is an access path? When does an index match an access path? What is a primary conjunct, and why is it important?
3. What information is stored in the system catalogs?
4. What are the benefits of making the system catalogs be relations?
5. What is the goal of query optimization? Why is optimization important?
Â
Â
What is metadata? What metadata is stored in the system catalog? Describe the information stored per relation, and per index. (Section 12.1)   The catalog is itself stored as a collection of relations. Explain why. (Section 12.1)   What three techniques are commonly used in algorithms to evaluate relational operators? (Section 12.2)   What is an access path? When does an index match a search condition? (Section 12.2.2)   What are the main approaches to evaluating selections? Discuss the use of indexes, in particular. (Section 12.3.1)   What are the main approaches to evaluating projections? What makes projections potentially expensive? (Section 12.3.2)   What are the main approaches to evaluating joins? Why are joins expensive? (Section 12.3.3)   What is the goal of query optimization? Is it to find the best plan? (Section 12.4)   How does a DBMS represent a relational query evaluation plan? (Section 12.4.1)   What is pipelined evaluation? What is its benefit? (Section 12.4.2)1.  Describe three techniques commonly used when developing algorithms for relational operators. Explain howthese techniques can be used to design algorithms for the selection, projection, and join operators.
Attachments:
-----------