May 2000
Intermediate to advanced
594 pages
11h 32m
English
Q: | |
29-28. | The matches are:
|
Q: | |
29-29. | There are several possible ways to improve the program. The following optimization eliminates the nested loops by accumulating the schedule in reverse, resulting in a program that is both faster and easier to understand (note that there are several versions on the book’s web page):
|
Q: | |
29-30. | You can create an anonymous PL/SQL block within an IF statement to declare and use memory only when necessary: PROCEDURE only_as_needed (...) IS
BEGIN
IF <condition>
THEN
DECLARE
big_string VARCHAR2(32767) := ten_minute_lookup (...);
big_list list_types.big_strings_tt;
BEGIN
use_big_string (big_string);
Process_big_list (big_list);
END;
ELSE
/* Nothing big
going on here */
...
END IF;
END; |
Q: | |
29-31. | You can use native dynamic SQL to easily change the status of a trigger:
|