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
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
GROUP BY results: unsorted<br />
• Hash Group by aggregation which allows a hash<br />
algorithm <strong>to</strong> process group by s<strong>ta</strong>tements<br />
• For sorts ORDER BY has <strong>to</strong> be used<br />
se<strong>le</strong>ct sum(sal), deptno from scott.emp group by deptno;<br />
se<strong>le</strong>ct sum(sal), deptno from scott.emp group by deptno;<br />
SUM(SAL) DEPTNO<br />
---------- ----------<br />
8750 10<br />
10875 20<br />
9400 30<br />
SUM(SAL) DEPTNO<br />
---------- ---------<br />
9400 30<br />
10875 20<br />
8750 10<br />
• Description see Note:345048.1<br />
• _gby_hash_aggregation_enab<strong>le</strong>d=false<br />
© 2010 O<strong>ra</strong>c<strong>le</strong> Corpo<strong>ra</strong>tion 43