Data Mgmt Lab_Part_40 - 118 64 9 25 A B C D 10 64 9 25 8 16...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 118 Chapter 11 10 64 9 25 A B C D 10 64 9 25 8 16 32 41 73 11 19 32 8 16 41 73 19 11 4 5 h h 1 00 01 10 11 000 001 010 011 Next = 0 h h 1 00 01 10 11 00 01 10 000 001 010 011 100 101 110 18 34 66 66 34 18 6 Insert 4, 5, 6 Next = 3 Figure 11.13 12 OVERVIEW OF QUERY EVALUATION Exercise 12.1 Briefly answer the following questions: 1. Describe three techniques commonly used when developing algorithms for rela- tional 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 storing the system catalogs as relations? 5. What is the goal of query optimization? Why is optimization important? 6. Describe pipelining and its advantages. 7. Give an example query and plan in which pipelining cannot be used. 8. Describe the iterator interface and explain its advantages....
View Full Document

{[ snackBarMessage ]}

Page1 / 3

Data Mgmt Lab_Part_40 - 118 64 9 25 A B C D 10 64 9 25 8 16...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online