Choose indices for the following SELECT statement. Specify whether your choices are clustered or unclustered, hash index or B + tree.
```
SELECT C.CrsName, COUNT(*)
FROM Course C, Transcript T
WHERE T.CrsCode = C.CrsCode AND T.Semester = :sem
GROUP BY T.CrsCode, C.CrsName
HAVING COUNT(*) ? 100
```
Suppose the primary key of Transcript is declared to be (Semester, CrsCode, StudId) with a corresponding B+ tree. Then the DBMS can identify all rows of Transcript satisfying the condition on Semester. These rows will already be grouped on CrsCode and hence the index supports the GROUP BY clause of the query. Each group can be scanned to determine which satis?es the HAVING clause and then any index on the CrsCode attribute of Course can be used to locate the unique row of Course containing the CrsName attribute for the group. Note that since the search key of the index on Transcript contains both Semester and CrsCode, it supports an index-only search. Hence, the rows of Transcript do not have to be accessed and as a result the index does not have to be clustered.
You might also like to view...
What are the base cases in the following recursive method?
``` public static void xMethod(int n) { if (n > 0) { System.out.print(n % 10); xMethod(n / 10); } } ``` a. n > 0 b. n <= 0 c. no base cases d. n < 0
Write an application that models a telephone keypad. Use a JPanel panel to hold twelve buttons—1, 2, 3, 4, 5, 6, 7, 8, 9, *, 0, #—in the center of a grid layout. Place a label in the south locations. As each number is pressed, append that digit to the text of the label.
What will be an ideal response?
In a lattice-based access control, the column of attributes associated with a particular object is referred to as a(n) ____.
A. need-to-know B. access control list (ACL) C. classification scheme D. rule-based configuration
Which of the following can be used preceding a command to prevent a process from terminating when the parent process terminates?
A. bg B. runat C. & D. nohup