Learn how to use simple algorithm analysis for Oracle performance tuning. Finding the mathematical functions that describe the computational complexity of different operations can help us understand and predict performance. This presentation will discuss common functions such as 1/N, LOG(N), N, N*LOG(N), N^2, and N!, and how they can help us understand operations such as sequence caching, bulk collect limit, index access, full table scans, hashing, sorting, joining, parallel processing, and choosing execution plans. This presentation also discusses times when the computational complexity is negated by implementation details. With a new way of looking at simple mathematical functions we can add algorithm analysis to our performance tuning toolkit.
-
Notifications
You must be signed in to change notification settings - Fork 0
Presentations based on content in Pro Oracle SQL Development.
ProOracleSQL/presentations
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Presentations based on content in Pro Oracle SQL Development.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published