There’s actually more to it than that. For every block in Oracle that changes, there’s:
1. Generation of redo on the upcoming undo block change 2. An undo (i.e., rollback segment) block change 3. Generation of redo on the upcoming data block change 4. A data block change
These four steps happen for every index and data block change. So, inserting into a table with n indexes will motivate on the order of (1+n)*2 units of redo to be written to your redo stream, and (1+n)*(1+1) blocks of undo and data to be written through your DBWR (actually more, because index leaf node insertions sometimes generate recursive SQL that propagates changes upward in the B*-tree, each block of which also generates redo and undo).
Cary Millsap -----Original Message-----
(1) one for the table insert. + (3) 1 for the header block, 1 for the branch block and 1 for the leaf block * number of indexes
I think Dave Ensor mentioned something like that in a presentation.
|
Title: RE: Anyone seen any independent performance .....
- Anyone seen any independent performance ..... Johnson, Michael
- RE: Anyone seen any independent performance ..... Jamadagni, Rajendra
- Re: Anyone seen any independent performance ..... Steve Perry
- RE: Anyone seen any independent performance ..... DENNIS WILLIAMS
- Re: Anyone seen any independent performance ..... Stephane Faroult
- Cary Millsap