M o v e to O ra c le D a ta b a s e 1 1 g â T h e w h o le S to ry
M o v e to O ra c le D a ta b a s e 1 1 g â T h e w h o le S to ry
M o v e to O ra c le D a ta b a s e 1 1 g â T h e w h o le S to ry
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Upg<strong>ra</strong>de Length<br />
• How long will the upg<strong>ra</strong>de <strong>ta</strong>ke<br />
<strong>to</strong> comp<strong>le</strong>te<br />
• Independent of:<br />
• Size of the da<strong>ta</strong>base<br />
• Used da<strong>ta</strong>types<br />
• Dependent mainly on:<br />
• The number of ins<strong>ta</strong>l<strong>le</strong>d components and options<br />
• Valid and non-s<strong>ta</strong><strong>le</strong> da<strong>ta</strong> dictiona<strong>ry</strong> s<strong>ta</strong>tistics<br />
• Number of synonyms – they'll get recompi<strong>le</strong>d (upg<strong>ra</strong>de from 9i)<br />
• Number of user objects in XDB (upg<strong>ra</strong>de from 10.2)<br />
• At a ve<strong>ry</strong> low <strong>ra</strong>te, if COMPATIBLE is increased:<br />
• Number of da<strong>ta</strong>fi<strong>le</strong>s<br />
• Size of redo logs<br />
© 2010 O<strong>ra</strong>c<strong>le</strong> Corpo<strong>ra</strong>tion 13
Change language