August 2009
Intermediate to advanced
893 pages
26h 48m
English
Content preview from Database Systems: Concepts, Design and Applications
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
State True/False
| 1. | Query processing is the procedure of selecting the most appropriate plan that is used in responding to a database request. |
| 2. | Execution plan is a series of query complication steps. |
| 3. | The cost of processing a query is usually dominated by secondary storage access, which is slow compared to memory access. |
| 4. | The transformed query is used to create a number of strategies called execution (or access) plans. |
| 5. | The internal query representation is usually a binary query tree. |
| 6. | A query is contradictory if its predicate cannot be satisfied by any tuple in the relation(s). |
| 7. | A query tree is also called a relational algebra tree. |
| 8. | Heuristic rules are used as an optimization technique to modify the internal representation of a query. ... |