Databases Reference
In-Depth Information
In step 5, we finally drop the functions created to clean the database.
There's more...
We have seen how using iterative functions led to better performance, even if the recursive
form of the algorithms is always more elegant and often less complicated.
We need to avoid recursive PL/SQL functions for one more reason—invoking recursive
functions consumes more memory in the PGA than its iterative counterpart. This is because
for each recursion, the state of the function (the copy of each parameter and variable and
the pointer to the current instruction) has to be stored in memory, and retrieved when the
execution flow returns to that recursion.
See also
F
The
Tuning the Program Global Area and the User Global Area
recipe in
Chapter 9
,
Tuning Memory
Using native compilation
In this recipe, we will see how to instruct the database to compile our stored procedures
in native form—rather than interpreted—to speed up the execution time.
